- #1
SlurrerOfSpeech
- 141
- 11
Does anyone know whether there exists a specialized Djikstra's algorithm for when every node has the same distance between it? Or to think of it another way, an algorithm for simply finding the minimum number of moves to get from 1 node to another?
e.g. in the following
the shortest path to F from A would be A -> B -> C -> F.
e.g. in the following
Code:
A - B - C
\ / / \
D E F G
the shortest path to F from A would be A -> B -> C -> F.