mxMinimumCycleRemover

An implementation of the first stage of the Sugiyama layout.  Straightforward longest path calculation of layer assignment

Summary
mxMinimumCycleRemoverAn implementation of the first stage of the Sugiyama layout.
Functions
mxMinimumCycleRemoverCreates a cycle remover for the given internal model.
Variables
layoutReference to the enclosing mxHierarchicalLayout.
Functions
executeTakes the graph detail and configuration information within the facade and creates the resulting laid out graph within that facade for further use.

Functions

mxMinimumCycleRemover

function mxMinimumCycleRemover(layout)

Creates a cycle remover for the given internal model.

Variables

layout

mxMinimumCycleRemover.prototype.layout

Reference to the enclosing mxHierarchicalLayout.

Functions

execute

mxMinimumCycleRemover.prototype.execute = function(parent)

Takes the graph detail and configuration information within the facade and creates the resulting laid out graph within that facade for further use.

function mxMinimumCycleRemover(layout)
Creates a cycle remover for the given internal model.
mxMinimumCycleRemover.prototype.layout
Reference to the enclosing mxHierarchicalLayout.
A hierarchical layout algorithm.
mxMinimumCycleRemover.prototype.execute = function(parent)
Takes the graph detail and configuration information within the facade and creates the resulting laid out graph within that facade for further use.
Close