Page History
This page describes the algorithm's five main phases and the available implementations. You can find a list and descriptions of the intermediate processors below over here.
Phase 1: Cycle Removal
The first phase makes sure that the graph doesn't contain any cycles. In some papers, this phase is an implicated part of the layering. This is due to the supporting function cycle removal has for layering: without cycles, we can find a topological ordering of the graph's nodes, which greatly simplifies layering.
...
Overview
Content Tools