61u

5 ms·

1. 1.▲
   by 61u 2y ago

   https://ideone.com/MGFwdo I am running BFS from only the starting node because the graph is symmetrical.
2. 2.▲
   by 61u 2y ago

   Just wondering... How do you calculate the minimum number of steps fast enough?
3. 3.▲
   by 61u 2y ago

   You could just run bfs from both starting and ending nodes until you find a node reachable from both the starting and ending nodes.