I recently came across a problem in SPOJ that asks the minimum length of the cycles starting at each node of the graph. For details: [Link](https://www.spoj.com/problems/ADACYCLE/) . ↵
↵
I solved it by considering each node as the root and found the minimum length cycle with BFS. You can find my code [Here](https://www.ideone.com/snnpnS) . ↵
↵
Now I'm wondering how it could be solved if there were 10^5 nodes instead of 2000. Any kind of help is appreciated.
↵
I solved it by considering each node as the root and found the minimum length cycle with BFS. You can find my code [Here](https://www.ideone.com/snnpnS) . ↵
↵
Now I'm wondering how it could be solved if there were 10^5 nodes instead of 2000. Any kind of help is appreciated.
