BuchheimWalkerAlgorithm class



BuchheimWalkerAlgorithm(BuchheimWalkerConfiguration configuration, EdgeRenderer? renderer)


configuration BuchheimWalkerConfiguration
getter/setter pair
hashCode int
The hash code for this object.
no setterinherited
maxNodeHeight double
getter/setter pair
maxNodeWidth double
getter/setter pair
minNodeHeight double
getter/setter pair
minNodeWidth double
getter/setter pair
nodeData Map<Node, BuchheimWalkerNodeData>
getter/setter pair
renderer EdgeRenderer?
getter/setter pairoverride
runtimeType Type
A representation of the runtime type of the object.
no setterinherited


ancestor(Graph graph, Node vim, Node node, Node defaultAncestor) Node?
apportion(Graph graph, Node node, Node defaultAncestor) Node
calculateGraphSize(Graph graph) Size
checkUnconnectedNotes(Graph graph) → void
compare(int x, int y) int
executeShifts(Graph graph, Node node) → void
filterByLevel(List<Node> nodes, int? level) List<Node>
findMaxSize(List<Node> nodes) Size
firstWalk(Graph graph, Node node, int depth, int number) → void
getFirstNode(Graph graph) Node
getLeftMostChild(Graph graph, Node? node) Node
getLeftSibling(Graph graph, Node node) Node?
getModifier(Node? vip) double
getNodeData(Node? node) BuchheimWalkerNodeData?
getOffset(Graph graph, bool needReverseOrder) Offset
getPosition(Node node, double globalPadding, Offset offset) Offset
getPrelim(Node? v) double
getRightMostChild(Graph graph, Node? node) Node?
getRightSibling(Graph graph, Node node) Node?
getSpacing(Graph graph, Node? leftNode, Node rightNode) num
hasLeftSibling(Graph graph, Node node) bool
hasPredecessor(Node node) bool
hasRightSibling(Graph graph, Node node) bool
hasSuccessor(Node? node) bool
init(Graph? graph) → void
initData(Graph? graph) → void
isLeaf(Graph graph, Node node) bool
isSibling(Graph graph, Node? leftNode, Node rightNode) bool
isVertical() bool
moveSubtree(Node? wm, Node wp, double shift) → void
needReverseOrder() bool
nextLeft(Graph graph, Node? node) Node?
nextRight(Graph graph, Node? node) Node?
noSuchMethod(Invocation invocation) → dynamic
Invoked when a nonexistent method or property is accessed.
positionNodes(Graph graph) → void
predecessorsOf(Node? node) List<Node>
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
secondWalk(Graph graph, Node node, double modifier) → void
setAncestor(Node? v, Node ancestor) → void
setDimensions(double width, double height) → void
setFocusedNode(Node node) → void
setModifier(Node? v, double modifier) → void
setThread(Node? v, Node thread) → void
shiftCoordinates(Graph graph, double shiftX, double shiftY) → void
sortByLevel(Graph graph, bool descending) List<Node>
step(Graph? graph) → void
successorsOf(Node? node) List<Node>
toString() String
A string representation of this object.


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