No, I don't think you can use Dijkstra's algorithm in this
case. Because in Dijkstra's algorithm, if you can go from
one node to another in say, two steps, it doesn't matter
which two steps you take, and furthermore, the best
overall solution will not take three steps between those
nodes. But that's not true in this matrix case.
In fact, this problem might even be NP-complete.
Abigail | [reply] |