Applying Dijkstra Algorithm For Solving Neutrosophic Shortest Path Problem
Download Applying Dijkstra Algorithm For Solving Neutrosophic Shortest Path Problem PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Applying Dijkstra Algorithm For Solving Neutrosophic Shortest Path Problem book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Applying Dijkstra Algorithm for Solving Neutrosophic Shortest Path Problem
The selection of shortest path problem is one the classic problems in graph theory. In literature, many algorithms have been developed to provide a solution for shortest path problem in a network.
Neutrosophic Shortest Path Problem
Neutrosophic set theory provides a new tool to handle the uncertainties in shortest path problem (SPP). This paper introduces the SPP from a source node to a destination node on a neutrosophic graph in which a positive neutrosophic number is assigned to each edge as its edge cost. We define this problem as neutrosophic shortest path problem (NSSPP). A simple algorithm is also introduced to solve the NSSPP. The proposed algorithm finds the neutrosophic shortest path (NSSP) and its corresponding neutrosophic shortest path length (NSSPL) between source node and destination node.
Neutrosophic Shortest Path Problem (NSPP) in a Directed Multigraph
One of the important non-linear data structures in Computer Science is graph. Most of the real life network, be it a road transportation network, or airlines network or a communication network etc., cannot be exactly transformed into a graph model, but into a Multigraphs model. The Multigraph is a topological generalization of the graph where multiple links (or edges/arcs) mayexist between two nodes unlike in graph.