You are viewing a single comment's thread. Return to all comments →
It is Dijkstra's algorithm with a twist. Be sure to keep track of already connected (side path found from s) nodes and exclude them from the loop.
Rust & Murderer
You are viewing a single comment's thread. Return to all comments →
It is Dijkstra's algorithm with a twist. Be sure to keep track of already connected (side path found from s) nodes and exclude them from the loop.