Generalization of Dijkstra’s Algorithm for Extraction of Shortest Paths in Directed Multigraphs
Siddhartha Sankar Biswas, Bashir Alam and M. N. Doja
DOI : 10.3844/jcssp.2013.377.382
Journal of Computer Science
Volume 9, Issue 3
The classical Dijkstra’s algorithm to find the shortest path in graphs is not applicable to multigraphs. In this study the authors generalize the classical Dijkstra’s algorithm to make it applicable to directed multigraphs. The modified algorithm is called by Generalized Dijkstra’s algorithm or GD Algorithm (GDA in short). The GDA outputs the shortest paths and the corresponding min cost. It is claimed that GDA may play a major role in many application areas of computer science, communication, transportation systems, in particular in those networks which cannot be modeled into graphs but into multigraphs.
© 2013 Siddhartha Sankar Biswas, Bashir Alam and M. N. Doja. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.