Geodesic
Odredjivanje najkraćih rastojanja u grafu
Nastava matematike, LIV (2009) no. 2-3, p. 38 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

Computer programmes for finding shortest distances in graphs are presented.
Classification : 1AMS97R20 97K30 2ZDMR24 K34
Keywords: Shortest distance in graph, Floyd's algorithm, Dijkstra's algorithm. 
@article{NM_2009_LIV_2-3_a6,
     author = {Zoran Vasiljevi\'c},
     title = {Odredjivanje najkra\'cih rastojanja u grafu},
     journal = {Nastava matematike},
     pages = {38 },
     year = {2009},
     volume = {LIV},
     number = {2-3},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/NM_2009_LIV_2-3_a6/}
}
TY  - JOUR
AU  - Zoran Vasiljević
TI  - Odredjivanje najkraćih rastojanja u grafu
JO  - Nastava matematike
PY  - 2009
SP  - 38 
VL  - LIV
IS  - 2-3
UR  - http://geodesic.mathdoc.fr/item/NM_2009_LIV_2-3_a6/
LA  - en
ID  - NM_2009_LIV_2-3_a6
ER  - 
%0 Journal Article
%A Zoran Vasiljević
%T Odredjivanje najkraćih rastojanja u grafu
%J Nastava matematike
%D 2009
%P 38 
%V LIV
%N 2-3
%U http://geodesic.mathdoc.fr/item/NM_2009_LIV_2-3_a6/
%G en
%F NM_2009_LIV_2-3_a6
Zoran Vasiljević. Odredjivanje najkraćih rastojanja u grafu. Nastava matematike, LIV (2009) no. 2-3, p. 38 . http://geodesic.mathdoc.fr/item/NM_2009_LIV_2-3_a6/