← Questions
Shortest path that avoids blocked nodes
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given an unweighted graph, a start node and a set of blocked nodes that cannot be entered, return the shortest distance from the start to every node (or to a given end node), with unreachable nodes marked as such. Run BFS that skips blocked nodes, and handle a blocked start or end.
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