BFS: Shortest Reach in a Graph

  • + 1 comment
    • Concern 1: no check is done because by using BFS you are guaranteed that the shortest path to the target is always hit first.
    • Concern 2: circularity is avoided by tracking already visited nodes.

    Check the video on the right, that's quite informative.