You are viewing a single comment's thread. Return to all comments →
The actual node ids input are 1-indexed, such as [1,2,3,4] but it's much easier in code to deal with 0-indexed items like [0,1,2,3]
Seems like cookies are disabled on this browser, please enable them to open this website
BFS: Shortest Reach in a Graph
You are viewing a single comment's thread. Return to all comments →
The actual node ids input are 1-indexed, such as [1,2,3,4] but it's much easier in code to deal with 0-indexed items like [0,1,2,3]