Calculates an ordering of the swim lanes such that: 1) the number of swim lanes traversed by edges is reduced.Namespace: yWorks.yFiles.Layout
Assembly: yWorks.yFilesSilverlight.Algorithms (in yWorks.yFilesSilverlight.Algorithms.dll) Version: 184.108.40.206
- Type: yWorks.yFiles.Algorithms..::..Graph
the input graph.
- Type: yWorks.yFiles.Algorithms..::..IDataProvider
a DataProvider assigning an object of class Swimlanes..::..SwimlaneRepresentant to each node in the graph. Two nodes v,w are in the same swim lane if they are assigned to the same swim lane representative. After calling this method, method SwimlanePos returns for each swim lane representative an integer value (>= 0) denoting the optimized position of the associated swim lane.
the number of iterations performed by the heuristic. The default value is 5.
Calculates an ordering of the swim lanes such that: 1) the number of swim lanes traversed by edges is reduced. 2) the number of swim lanes spanned by group nodes (see GraphGrouping ) is reduced. (Note, that a group node can span a swim lane without having a descendant in it.)