Description: There is a vertex, r, in the graph G={V,E}. As to every other vertex v, there exist several paths between v and r. The Dijkstra algorithm can get the hop count of the shortest path among those between v and r.
To Search:
File list (Check if you may need any files):
Dijkstra.m
Download