Detail publikace

Introduction to Graph Algorithms for Shortest-Paths Problems

KŘIVKA, Z.

Originální název

Introduction to Graph Algorithms for Shortest-Paths Problems

Typ

článek souhrnný, posudek

Jazyk

angličtina

Originální 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.

Autoři

KŘIVKA, Z.

Vydáno

28. 7. 2017

ISSN

2386-866X

Ročník

4

Číslo

5

Strany od

41

Strany do

48

Strany počet

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

Dokumenty

SEGOBIT-V04-N05-P041.pdf