← Questions
Fewest nodes on a path when one vertex may be broken
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Find the path between two nodes of a graph that passes through the fewest nodes, and return that count. One vertex may be broken and unusable: handle both the case where it matters and where it does not, and explain how your search changes.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding