Examples of org.gephi.graph.api.NodeIterable

org.gephi.graph.api.NodeIterable
Proxy iterable for iterating nodes, users can either get NodeIterator or directly getting an Node array.
This iterable has an additionnal feature, it locks automatically the graph when the iterator is called and unlocks it when iterator terminates. That means calling break; before the iterator terminates won't unlock the graph. The doBreak() method will properly unlock the graph. Note that calling toArray() avoid this issue.
If you're not sure if the graph is properly unlocked, for instance when exception are thrown within the loop, use {@link Graph#readUnlockAll()}. @author Mathieu Bastian @see Graph#readLock()

            LinkedList<Node> Q = new LinkedList<Node>();
            //The component-list
            LinkedList<Node> component = new LinkedList<Node>();


            //Seed the seach Q
            NodeIterable iter = hgraph.getNodes();
            for (Node first : iter) {
                if (color[indicies.get(first)] == 0) {
                    Q.add(first);
                    iter.doBreak();
                    break;
                }
            }


            //While there are more nodes to search

View Full Code Here

            LinkedList<Node> S = new LinkedList<Node>();
            //The component-list
            //LinkedList<Node> component = new LinkedList<Node>();
            //Seed the seach Q
            Node first = null;
            NodeIterable iter = hgraph.getNodes();
            for (Node u : iter) {
                if (index[indicies.get(u)] == 0) {
                    first = u;
                    iter.doBreak();
                    break;
                }
            }
            if (first == null) {
                hgraph.readUnlockAll();

View Full Code Here

    }


    private void updateNodes(HierarchicalGraph graph) {
        Modeler nodeInit = engine.getModelClasses()[AbstractEngine.CLASS_NODE].getCurrentModeler();


        NodeIterable nodeIterable;
        nodeIterable = graph.getNodes();




        for (Node node : nodeIterable) {

View Full Code Here

        }
        xmlWriter.writeStartElement(NODES);


        AttributeColumn dynamicCol = dynamicCol = attributeModel.getNodeTable().getColumn(DynamicModel.TIMEINTERVAL_COLUMN);


        NodeIterable nodeIterable = exportHierarchy ? graph.getNodesTree() : graph.getNodes();
        for (Node node : nodeIterable) {
            xmlWriter.writeStartElement(NODE);


            String id = node.getNodeData().getId();
            xmlWriter.writeAttribute(NODE_ID, id);

View Full Code Here

            LinkedList<Node> Q = new LinkedList<Node>();
            //The component-list
            LinkedList<Node> component = new LinkedList<Node>();


            //Seed the seach Q
            NodeIterable iter = graph.getNodes();
            for (Node first : iter) {
                if (color[indicies.get(first)] == 0) {
                    Q.add(first);
                    iter.doBreak();
                    break;
                }
            }


            //While there are more nodes to search

View Full Code Here

            LinkedList<Node> S = new LinkedList<Node>();
            //The component-list
            //LinkedList<Node> component = new LinkedList<Node>();
            //Seed the seach Q
            Node first = null;
            NodeIterable iter = graph.getNodes();
            for (Node u : iter) {
                if (index[indicies.get(u)] == 0) {
                    first = u;
                    iter.doBreak();
                    break;
                }
            }
            if (first == null) {
                return allComponents;

View Full Code Here

    }


    private float computeNodeClusteringCoefficient(Graph hgraph, Node node, boolean directed) {
        float nodeCC = 0;
        int neighborhood = 0;
        NodeIterable neighbors1 = hgraph.getNeighbors(node);
        for (Node neighbor1 : neighbors1) {
            neighborhood++;
            NodeIterable neighbors2 = hgraph.getNeighbors(node);


            for (Node neighbor2 : neighbors2) {
                nodeCC = increaseCCifNesessary(hgraph, neighbor1, neighbor2, directed, nodeCC);
            }
        }

View Full Code Here

TOP

Related Classes of org.gephi.graph.api.NodeIterable

org.gephi.io.exporter.plugin.ExporterGEXF

org.gephi.statistics.plugin.ClusteringCoefficient

org.gephi.statistics.plugin.ConnectedComponents

org.gephi.visualization.bridge.DHNSDataBridge

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.