Review

KŘIVKA Zbyněk. Introduction to Graph Algorithms for Shortest-Paths Problems. Sego-Bit. Segovia: University of Valladolid, 2017, vol. 4, no. 5. ISSN 2386-866X.
Publication language:english
Original title:Introduction to Graph Algorithms for Shortest-Paths Problems
Pages:41-48
Place:ES
Year:2017
Journal:Sego-Bit, Vol. 4, No. 5, Segovia, ES
ISSN:2386-866X
URL:https://www.dropbox.com/s/zs867t534ryl7jl/SEGOBIT-V04-N05-P041.pdf?dl=0 [PDF]
Files: 
+Type Name Title Size Last modified
iconSEGOBIT-V04-N05-P041.pdf423 KB2017-07-28 14:17:30
^ Select all
With selected:
Annotation
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.

Your IPv4 address: 54.92.201.232
Switch to IPv6 connection

DNSSEC [dnssec]