Examples of TreeIterator

cc.redberry.core.tensor.iterator.TreeIterator
Parent interface for tree iterators. @author Dmitry Bolotin @author Stanislav Poslavsky @since 1.0
org.eclipse.emf.common.util.TreeIterator
A mechanism for iterating over all the nodes of a tree; it provides the capability to {@link #prune prune} the iteration so that all descendants of a particular node are skipped.
org.gephi.graph.dhns.node.iterators.TreeIterator
{@link AbstractNode} iterator for all nodes nodes. If predicate contains the **enabled** predicate,skipping is true and descendants of enabled nodes are skipped @author Mathieu Bastian

Examples of org.gephi.graph.dhns.node.iterators.TreeIterator

            }
        }
    }


    public void computeMetaEdges() {
        for (TreeIterator itr = new TreeIterator(treeStructure, true, Tautology.instance); itr.hasNext();) {
            AbstractNode node = itr.next();
            computeMetaEdges(node, node);
        }
    }

View Full Code Here

Examples of org.gephi.graph.dhns.node.iterators.TreeIterator

            }
            edgeProcessor.resetEdgesCounting(node);
        }
        view.setEdgesCountEnabled(0);
        view.setMutualEdgesEnabled(0);
        for (TreeIterator itr = new TreeIterator(treeStructure, true, Tautology.instance); itr.hasNext();) {
            AbstractNode node = itr.next();
            edgeProcessor.computeMetaEdges(node, node);
            edgeProcessor.computeEdgesCounting(node);
        }
        graphVersion.incNodeAndEdgeVersion();
        dhns.writeUnlock();

View Full Code Here

Examples of org.gephi.graph.dhns.node.iterators.TreeIterator

            }
            edgeProcessor.resetEdgesCounting(node);
        }
        view.setEdgesCountEnabled(0);
        view.setMutualEdgesEnabled(0);
        for (TreeIterator itr = new TreeIterator(treeStructure, true, Tautology.instance); itr.hasNext();) {
            AbstractNode node = itr.next();
            edgeProcessor.computeMetaEdges(node, node);
            edgeProcessor.computeEdgesCounting(node);
        }
        graphVersion.incNodeAndEdgeVersion();
        dhns.writeUnlock();

View Full Code Here

Examples of org.gephi.graph.dhns.node.iterators.TreeIterator

            }
            edgeProcessor.resetEdgesCounting(node);
        }
        view.setEdgesCountEnabled(0);
        view.setMutualEdgesEnabled(0);
        for (TreeIterator itr = new TreeIterator(treeStructure, true, Tautology.instance); itr.hasNext();) {
            AbstractNode node = itr.next();
            edgeProcessor.computeMetaEdges(node, node);
            edgeProcessor.computeEdgesCounting(node);
        }
        graphVersion.incNodeAndEdgeVersion();
        dhns.writeUnlock();

View Full Code Here

Examples of org.gephi.graph.dhns.node.iterators.TreeIterator

    }


    public void flatten() {
        dhns.writeLock();
        if (treeStructure.getTreeHeight() > 1) {
            TreeIterator nodesIterator = new TreeIterator(treeStructure, true, Tautology.instance);
            for (; nodesIterator.hasNext();) {
                AbstractNode node = nodesIterator.next();
                AbstractEdge[] newEdges = edgeProcessor.flattenNode(node);
                if (newEdges != null) {
                    for (int i = 0; i < newEdges.length; i++) {
                        AbstractEdge e = newEdges[i];
                        if (e != null) {

View Full Code Here

Examples of org.gephi.graph.dhns.node.iterators.TreeIterator

    }


    //Graph
    public EdgeIterable getEdges() {
        readLock();
        return dhns.newEdgeIterable(new EdgeIterator(structure, new TreeIterator(structure, true, Tautology.instance), false, enabledNodePredicate, Tautology.instance));
    }

View Full Code Here

Examples of org.gephi.graph.dhns.node.iterators.TreeIterator

    }


    //ClusteredGraph
    public EdgeIterable getEdgesTree() {
        readLock();
        return dhns.newEdgeIterable(new EdgeIterator(structure, new TreeIterator(structure, true, Tautology.instance), false, Tautology.instance, Tautology.instance));
    }

View Full Code Here

Examples of org.gephi.graph.dhns.node.iterators.TreeIterator

    }


    //ClusteredGraph
    public EdgeIterable getMetaEdges() {
        readLock();
        return dhns.newEdgeIterable(new MetaEdgeIterator(structure, new TreeIterator(structure, true, Tautology.instance), false));
    }

View Full Code Here

Examples of org.gephi.graph.dhns.node.iterators.TreeIterator

        return dhns.newEdgeIterable(new MetaEdgeIterator(structure, new TreeIterator(structure, true, Tautology.instance), false));
    }


    public EdgeIterable getEdgesAndMetaEdges() {
        readLock();
        return dhns.newEdgeIterable(new EdgeAndMetaEdgeIterator(structure, new TreeIterator(structure, true, Tautology.instance), false, enabledNodePredicate, Tautology.instance));
    }

View Full Code Here

Examples of org.gephi.graph.dhns.node.iterators.TreeIterator

        return dhns.getGraphStructure().getEdgeFromDictionnary(id);
    }


    public NodeIterable getNodes() {
        readLock();
        return dhns.newNodeIterable(new TreeIterator(structure, true, Tautology.instance));
    }

View Full Code Here

0 1 2 3

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.