AccumulatorTree (JunGrapht Visualization 1.1 API)

java.lang.Object
- org.jungrapht.visualization.layout.algorithms.sugiyama.AccumulatorTree<V,E>

```
public class AccumulatorTree<V,E>
extends Object
```
Accumulator tree for counting edge crossing
Modified from Waddle/Malhorta to use a 0 based array instead of 1 based

See Also:

"An E log E Line Crossing Algorithm for Levelled Graphs. Vance Waddle and Ashok Malhotra IBM Thomas J. Watson Research Center", "Simple and Efficient Bilayer Cross Counting. Wilhelm Barth, Petra Mutzel, Institut für Computergraphik und Algorithmen Technische Universität Wien, Michael Jünger, Institut für Informatik Universität zu Köln"

Constructor Summary

Constructors
Constructor Description

AccumulatorTree(int size)

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`void`	`addEdge(int pos)`
`int`	`countEdges(int n, int last)`
`int`	`crossCount(int[] southSequence)`
`int`	`crossWeight(int[] southSequence, Function<Integer,Integer> weight)`
`int`	`crossWeight(LE<V,E>[] edgeArray, Function<Integer,Integer> weight)`
`int`	`getBase()`
`void`	`subtractEdge(int pos)`
`String`	`toString()`

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail
- AccumulatorTree
```
public AccumulatorTree(int size)
```

Method Detail

countEdges

public int countEdges(int n,
                      int last)

crossCount

public int crossCount(int[] southSequence)

crossWeight

public int crossWeight(int[] southSequence,
                       Function<Integer,Integer> weight)

Parameters:: southSequence -; weight -
Returns:

crossWeight

public int crossWeight(LE<V,E>[] edgeArray,
                       Function<Integer,Integer> weight)

getBase
```
public int getBase()
```

addEdge
```
public void addEdge(int pos)
```

subtractEdge
```
public void subtractEdge(int pos)
```

toString
```
public String toString()
```
Overrides:

toString in class Object