Introduction to Graph Algorithms for Shortest-Paths Problems
KŘIVKA Zbyněk. Introduction to Graph Algorithms for Shortest-Paths Problems. Sego-Bit, vol. 4, no. 5. ISSN 2386-866X.
Křivka Zbyněk, Ing., Ph.D. (DIFS FIT BUT)
The paper introduces basic graph notions and definitions to describe few shortest-paths problems. Then, two standard graph representations are described, and two classical algorithms solving shortest-paths problems, namely Bellman-Ford and Dijkstra algorithms, are explained. In the end, new software tool supporting the explanation of graph algorithms is presented.
Sego-Bit, vol. 4, no. 5, ISSN 2386-866X
University of Valladolid