This is a collection of interesting Leetcode questions I came across
- Tarjan's algorithm
I found this question on Leetcode
This solution uses a modified Tarjan's algorithm to identify links between strongly connected groups
The modification to the stock algorithm is needed to take care of a non-directed graph