61u

Joined 2 years ago

Karma

1

Submissions

3

Member since

Apr 16

View on Hacker News

Recent submissions

Comment · 2 years ago

https://ideone.com/MGFwdo

I am running BFS from only the starting node because the graph is symmetrical.

Comment · 2 years ago

Just wondering... How do you calculate the minimum number of steps fast enough?

Comment · 2 years 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.