SugiyamaAlgorithm class



SugiyamaAlgorithm(SugiyamaConfiguration configuration)


configuration SugiyamaConfiguration
getter/setter pair
dummyId int
no setter
edgeData Map<Edge, SugiyamaEdgeData>
getter/setter pair
graph Graph
getter/setter pair
hashCode int
The hash code for this object.
no setterinherited
layers List<List<Node>>
getter/setter pair
nodeCount int
getter/setter pair
nodeData Map<Node, SugiyamaNodeData>
getter/setter pair
renderer EdgeRenderer?
getter/setter pairoverride
runtimeType Type
A representation of the runtime type of the object.
no setterinherited
stack Set<Node>
getter/setter pair
type1Conflicts Map<int, int>
visited Set<Node>
getter/setter pair


assignX() → void
assignY() → void
balance(List<Map<Node, double>> x, List<Map<Node?, double>> blockWidth) → void
calculateGraphSize(Graph graph) Size
coordinateAssignment() → void
copyGraph(Graph graph) Graph
crossing(List<List<Node>> layers) int
crossingCount(HashMap<Node, int> northernNodes, Node? n1, Node? n2) int
cycleRemoval() → void
denormalize() → void
dfs(Node node) → void
exchange(List<Node> nodes, Node v, Node w) → void
getAdjNodes(Node node, bool downward) List<Node>
getLayerIndex(Node? node) int
getOffset(Graph graph, bool needReverseOrder) Offset
getPosition(Node node, Offset offset) Offset
getPreviousNonDummyNode(List<Node> layerNodes, int currentIndex) Node?
getRootNodes(Graph graph) List<Node>
horizontalCompactation(Map<Node, Node> align, Map<Node, Node> root, Map<Node, Node> sink, Map<Node, double> shift, Map<Node, double> blockWidth, Map<Node, double> x, bool leftToRight, bool downward, List<List<Node>> layers, int separation) → void
init(Graph? graph) → void
initSugiyamaData() → void
isLongEdgeDummy(Node? v) bool
isVertical() bool
layerAssignment() → void
markType1Conflicts(bool downward) Map<int, int>
median(List<List<Node?>> layers, int currentIteration) → void
needReverseOrder() bool
nodeOrdering() → void
noSuchMethod(Invocation invocation) → dynamic
Invoked when a nonexistent method or property is accessed.
placeBlock(Node v, Map<Node, Node> sink, Map<Node, double> shift, Map<Node, double> x, Map<Node, Node> align, Map<Node, double> blockWidth, Map<Node, Node> root, bool leftToRight, List<List<Node>> layers, int separation) → void
positionOfNode(Node? node) int
predecessor(Node? v, bool leftToRight) Node?
predecessorsOf(Node? node) List<Node>
reset() → void
resolveOverlaps(Map<Node, double> coordinates) → void
restoreCycle() → void
run(Graph? graph, double shiftX, double shiftY) Size
Executes the algorithm. @param shiftY Shifts the y-coordinate origin @param shiftX Shifts the x-coordinate origin @return The size of the graph
setDimensions(double width, double height) → void
setFocusedNode(Node node) → void
shiftCoordinates(double shiftX, double shiftY) → void
step(Graph? graph) → void
successorsOf(Node? node) List<Node>
toString() String
A string representation of this object.
transpose(List<List<Node>> layers) bool
verticalAlignment(Map<Node?, Node?> root, Map<Node?, Node?> align, Map<int, int> type1Conflicts, bool downward, bool leftToRight) → void
virtualTwinNode(Node node, bool downward) Node?


operator ==(Object other) bool
The equality operator.