when i perform a BFS on a graph until i find the required node and print the predesessor vector i don't get nodes that are on the shortest path. i get nodes that are not on the shortest path as well
How can i resolve this issue?
Please help.
when i perform a BFS on a graph until i find the required node and print the predesessor vector i don't get nodes that are on the shortest path. i get nodes that are not on the shortest path as well
How can i resolve this issue?
Please help.
Use the boost c++ library.
Or, alternately, post your code so we can see what you're doing wrong.
We haven't written an ESP program (yet), so reading your mind is out of the question. Sorry.
Consider this post signed
