GENERALIZATION OF DIJKSTRA�S ALGORITHM FOR EXTRACTION OF SHORTEST PATHS IN DIRECTED MULTIGRAPHS | Science Publications

Journal of Computer Science

Bashir Alam¹  M. N. Doja¹  Siddhartha Sankar Biswas¹ 

关键词: Min-Weight Multiset;    Multigraphs;    Shortest Path Estimate;    Relaxation;    GDA;   

DOI  :  10.3844/jcssp.2013.377.382

学科分类：计算机科学（综合）

来源: Science Publications

【 摘 要 】

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."

【 授权许可】

Unknown