EiglspergerAlgorithm class

Inheritance

• Object
• Algorithm
• EiglspergerAlgorithm

Constructors

EiglspergerAlgorithm(SugiyamaConfiguration configuration)

Properties

configuration ↔ SugiyamaConfiguration

getter/setter pair

dummyId → int

no setter

graph ↔ Graph

getter/setter pair

hashCode → int

The hash code for this object.

no setter, inherited

layers ↔ List<List<Node>>

getter/setter pair

nodeCount ↔ int

getter/setter pair

nodeData ↔ Map<Node, EiglspergerNodeData>

getter/setter pair

renderer ↔ EdgeRenderer?

getter/setter pair, override

runtimeType → Type

A representation of the runtime type of the object.

no setter, inherited

segments ↔ List<Segment>

getter/setter pair

stack ↔ Set<Node>

getter/setter pair

typeOneConflicts ↔ Set<Edge>

getter/setter pair

visited ↔ Set<Node>

getter/setter pair

Methods

assignPositions(List<LayerElement> layer) → void

assignX() → void

assignXx() → void

assignY() → void

backwardSweep(List<List<Node>> layers) → double

balance(List<Map<Node, double>> x, List<Map<Node?, double>> blockWidth) → void

coordinateAssignment() → void

copyGraph(Graph graph) → Graph

countWeightedCrossings(List edges, List<LayerElement> nextLayer) → double

createLayerElements(List<Node> layer) → List<LayerElement>

createSegment(Edge edge) → void

createSegmentsForLongEdges() → void

createSingleDummyVertex(Edge edge, int dummyLayer) → void

cycleRemoval() → void

denormalize() → void

dfs(Node node) → void

extractNodes(List<LayerElement> elements) → List<Node>

forwardSweep(List<List<Node>> layers) → double

getAdjNodes(Node node, bool downward) → List<Node>

getEdgeWeight(dynamic edge) → int

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>

getTargetPosition(dynamic edge, List<LayerElement> nextLayer) → int

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

override

initNodeData() → void

isLongEdgeDummy(Node? v) → bool

isVertical() → bool

layerAssignment() → void

mergeSortedLists(List<LayerElement> vertices, List<ContainerElement> containers) → List<LayerElement>

needReverseOrder() → bool

nodeOrdering() → void

noSuchMethod(Invocation invocation) → dynamic

Invoked when a nonexistent method or property is accessed.

inherited

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

override

setDimensions(double width, double height) → void

override

shiftCoordinates(double shiftX, double shiftY) → void

stepFive(List<LayerElement> currentLayer, List<LayerElement> nextLayer, int currentRank, int nextRank) → double

stepFour(List<LayerElement> layer, int layerIndex) → void

stepOne(List<LayerElement> layer, bool isForward) → void

stepSix(List<LayerElement> layer) → void

stepThree(List<LayerElement> layer) → void

stepTwo(List<LayerElement> currentLayer, List<LayerElement> nextLayer) → void

successorsOf(Node? node) → List<Node>

toString() → String

A string representation of this object.

inherited

updateIndices(List<LayerElement> layer) → void

updateNodePositions() → void

verticalAlignment(Map<Node?, Node?> root, Map<Node?, Node?> align, Map<int, int> type1Conflicts, bool downward, bool leftToRight) → void

virtualTwinNode(Node node, bool downward) → Node?

Operators

operator ==(Object other) → bool

The equality operator.

inherited

Static Methods

medianValue(List<int> positions) → double