Result Details
Introduction to Graph Algorithms for Shortest-Paths Problems
KŘIVKA, Z. Introduction to Graph Algorithms for Shortest-Paths Problems. Sego-bit. 2017. no. 5, p. 41-48. ISSN: 2386-866X.
Type
article - other
Language
English
Authors
Křivka Zbyněk, Ing., Ph.D., DIFS (FIT)
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.
URL
Published
2017
Pages
41–48
Journal
Sego-bit, vol. 4, no. 5, ISSN 2386-866X
BibTeX
@misc{BUT168424,
author="Zbyněk {Křivka}",
title="Introduction to Graph Algorithms for Shortest-Paths Problems",
year="2017",
journal="Sego-bit",
volume="4",
number="5",
pages="41--48",
url="https://www.fit.vut.cz/research/publication/11500/",
note="Article - other"
}
Files
Projects
Nástroje, metody a technologie ICT pro podporu konceptu smart cities, BUT, Vnitřní projekty VUT, FIT-S-17-3964, start: 2017-03-01, end: 2020-02-29, completed
Research groups
Formal Model Research Group (RG FM)
Departments