Examples of org.gephi.graph.api.EdgeIterable

org.gephi.graph.api.EdgeIterable
Proxy iterable for iterating edges, users can either get EdgeIterator or directly getting an Edge array.
This iterable has an additionnal feature, it automatically lock the graph when the iterator is called and unlock 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()

    }


    private double updateValueForNode(Graph hgraph, Node s, double[] pagerankValues, double[] weights,
            HashMap<Node, Integer> indicies, boolean directed, boolean useWeights, double r, double prob) {
        double res = r;
        EdgeIterable eIter;
        if (directed) {
            eIter = ((DirectedGraph) hgraph).getInEdges(s);
        } else {
            eIter = hgraph.getEdges(s);
        }

View Full Code Here

        double max = 0.;
        int N = hgraph.getNodeCount();


        for (int i = 0; i < N; i++) {
            Node u = indicies.get(i);
            EdgeIterable iter = null;
            if (directed) {
                iter = ((DirectedGraph) hgraph).getInEdges(u);
            } else {
                iter = hgraph.getEdges(u);
            }

View Full Code Here

                //Get the next Node and add it to the component list
                Node u = Q.removeFirst();
                component.add(u);


                //Iterate over all of u's neighbors
                EdgeIterable edgeIter = graph.getEdges(u);


                //For each neighbor
                for (Edge edge : edgeIter) {
                    Node reachable = graph.getOpposite(u, edge);
                    int id = indicies.get(reachable);

View Full Code Here

        int id = indicies.get(f);
        index[id] = count;
        low_index[id] = count;
        count++;
        S.addFirst(f);
        EdgeIterable edgeIter = graph.getOutEdges(f);
        for (Edge e : edgeIter) {
            Node u = graph.getOpposite(f, e);
            int x = indicies.get(u);
            if (index[x] == 0) {
                tarjans(components, S, graph, u, index, low_index, indicies);

View Full Code Here

    void updateAutorithy(Graph hgraph, double[] newValues, double[] hubValues, boolean isDirected, Map<Node, Integer> indicies) {
        double norm = 0;
        int j = 0;
        for (Node node : hgraph.getNodes()) {
            double auth = 0;
            EdgeIterable edge_iter;
            if (isDirected) {
                edge_iter = ((DirectedGraph) hgraph).getInEdges(node);
            } else {
                edge_iter = hgraph.getEdges(node);
            }

View Full Code Here

    void updateHub(Graph hgraph, double[] newValues, double[] authValues, boolean isDirected, Map<Node, Integer> indicies) {
        double norm = 0;
        int j = 0;
        for (Node node : hgraph.getNodes()) {
            double hub = 0;
            EdgeIterable edge_iter;
            if (isDirected) {
                edge_iter = ((DirectedGraph) hgraph).getOutEdges(node);
            } else {
                edge_iter = hgraph.getEdges(node);
            }

View Full Code Here

0 1

TOP

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

org.gephi.io.exporter.plugin.ExporterGDF

org.gephi.io.exporter.plugin.ExporterGEXF

org.gephi.io.exporter.plugin.ExporterGraphML

org.gephi.statistics.plugin.ConnectedComponents

org.gephi.statistics.plugin.EigenvectorCentrality

org.gephi.statistics.plugin.Hits

org.gephi.statistics.plugin.PageRank

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.