We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Graph Theory
  4. Breadth First Search: Shortest Reach
  5. Discussions

Breadth First Search: Shortest Reach

  • theshteves
     + 8 comments

    I don't know your specifics but my Python passed all except for a runtime KeyError on that one. I fixed it by verifying that a node HAD any edges before looking to update all adjacent nodes.

    if node in edge_map.keys():  # populate BFS_map

    Hope that helps trim some time for you.