remove crossings from a layered graph
the layers of nodes that this should rearrange.
sets whether the dfs should be top down or bottom up
This has a small tweak in effect and can be useful for multiple initial configurations.
(default: true)
get whether the current operator is topDown
Generated using TypeDoc
a depth first search operator
This is a fast heuristic that runs a depth first search, incrementally adding nodes to their appropriate layer. It creates a reasonable ordering to potentially be further optimized by other operators.