Find the longest cycle in a grid of arrows.
No surprises in this implementation. Use a set so that we visit each node at most once. Check for a cycle when attempting to visit an already-visited node.
Find the longest cycle in a grid of arrows.
No surprises in this implementation. Use a set so that we visit each node at most once. Check for a cycle when attempting to visit an already-visited node.