rblock solution: - keep an adj mat with only the shortest path - run dijkstra's to find shortest distance between house and barn (make sure to keep track of the edges traversed) - iterate over the edges traversed: - double each edge individually - run dijkstra's to find shortest distance - print max distance - original distance
rblock solution:
- double each edge individually
- run dijkstra's to find shortest distance