Ring computation
Stage 2
- Depth first search used to find ring structures by ordering nodes according to Pr(i), choosing the most expensive outbound link and searching until the remote end of the link is visited.
- As rings are found using DFS, node priorities are recalculated and new DFSes are initiated from the highest priority node. A ring cover is computed when no link remains uncovered.