so i was reading <a href="http://en.wikipedia.org/wiki/
Dijkstra's_algorithm">wiki</a> on dijkstra's algorithm for finding
shortest path. i dont think article specifically define the
requirements of the graph in order to make the algorithm working
properly.(unless i missed something?)
for instance, in the graph below, the shortest path from 1to1 should
be 1>7>2>1. however, by following dijkstra's, you would get 1>4>9>1
because compared to 7, 4 is smallest among all direct vertices.
1
/ \
2 9
| |
7 4
\ /
1
anyone knows the requirements, especially the ration of #of edges to
#of vertices?
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
