Publication detail

Introduction to Graph Algorithms for Shortest-Paths Problems

KŘIVKA, Z.

Original Title

Introduction to Graph Algorithms for Shortest-Paths Problems

Type

review

Language

English

Original 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.

Authors

KŘIVKA, Z.

Released

28. 7. 2017

ISBN

2386-866X

Year of study

4

Number

5

Pages from

41

Pages to

48

Pages count

8

URL

https://www.fit.vut.cz/research/publication/11500/

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"
}

Documents

SEGOBIT-V04-N05-P041.pdf