Examples of org.gephi.graph.dhns.utils.avl.EdgeOppositeTree

org.gephi.graph.dhns.utils.avl.EdgeOppositeTree

Special type of tree which knows his {@link AbstractNode} owner. The AVLItemAccessor alwaysreturn the number of the AbstractNode linked to the owner.

This type of tree stores {@link AbstractEdge}. These edges can be IN or OUT. The instance of the edge is duplicated in each node, once as IN and once as OUT. In each node, the tree key must be the neigbour's number. So the getNumber() method compare the given item with the owner and returns the neighbour's number. @author Mathieu Bastian

        this.pre = pre;
        this.size = size;
        this.level = level;
        this.post = pre - level + size;
        this.nodeData = nodeData;
        edgesOutTree = new EdgeOppositeTree(this);
        edgesInTree = new EdgeOppositeTree(this);
        metaEdgesOutTree = new MetaEdgeTree(this);
        metaEdgesInTree = new MetaEdgeTree(this);
    }

Examples of org.gephi.graph.dhns.utils.avl.EdgeOppositeTree

Related Classes of org.gephi.graph.dhns.utils.avl.EdgeOppositeTree