Detail publikace

Introduction to Graph Algorithms for Shortest-Paths Problems

KŘIVKA, Z. Introduction to Graph Algorithms for Shortest-Paths Problems. 2017. p. 41-48. ISSN: 2386-866X.
Typ
článek souhrnný, posudek
Jazyk
anglicky
Autoři
Křivka Zbyněk, Ing., Ph.D. (UIFS)
URL
Abstrakt

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.

Rok
2017
Strany
41–48
Svazek
4
Číslo
5
BibTeX 
@misc{BUT168424,
  author="Zbyněk {Křivka}",
  title="Introduction to Graph Algorithms for Shortest-Paths Problems",
  year="2017",
  volume="4",
  number="5",
  pages="41--48",
  issn="2386-866X",
  url="https://www.fit.vut.cz/research/publication/11500/",
  note="review"
}
Nahoru