Geodesic
Algoritmi Nalaženja Najkraćih Puteva u Grafovima i Njihova Primena
Nastava matematike, XLII (1997) no. 1-2, p. 32 Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Voir la notice de l'article

Some most standard algorithms for finding shortest path in a graph are described.
Classification : 00A35
Keywords: Dijkstra'a algorithm, Floyd-Worshell's algorithm 
@article{NM_1997_XLII_1-2_a6,
     author = {Stanka Matkovi\'c},
     title = {Algoritmi {Nala\v{z}enja} {Najkra\'cih} {Puteva} u {Grafovima} i {Njihova} {Primena}},
     journal = {Nastava matematike},
     pages = {32 },
     year = {1997},
     volume = {XLII},
     number = {1-2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/NM_1997_XLII_1-2_a6/}
}
TY  - JOUR
AU  - Stanka Matković
TI  - Algoritmi Nalaženja Najkraćih Puteva u Grafovima i Njihova Primena
JO  - Nastava matematike
PY  - 1997
SP  - 32 
VL  - XLII
IS  - 1-2
UR  - http://geodesic.mathdoc.fr/item/NM_1997_XLII_1-2_a6/
LA  - en
ID  - NM_1997_XLII_1-2_a6
ER  - 
%0 Journal Article
%A Stanka Matković
%T Algoritmi Nalaženja Najkraćih Puteva u Grafovima i Njihova Primena
%J Nastava matematike
%D 1997
%P 32 
%V XLII
%N 1-2
%U http://geodesic.mathdoc.fr/item/NM_1997_XLII_1-2_a6/
%G en
%F NM_1997_XLII_1-2_a6
Stanka Matković. Algoritmi Nalaženja Najkraćih Puteva u Grafovima i Njihova Primena. Nastava matematike, XLII (1997) no. 1-2, p. 32 . http://geodesic.mathdoc.fr/item/NM_1997_XLII_1-2_a6/