Publication Details

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.
Type
review
Language
english
Authors
URL
Abstract
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.
Published
2017
Pages
41-48
Journal
Sego-Bit, vol. 4, no. 5, ISSN 2386-866X
Publisher
University of Valladolid
Back to top