Package org.gephi.graph.api

Examples of org.gephi.graph.api.DirectedGraph

373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
    @Test
    public void testDirectedStarOutEigenvectorCentrality() {
        GraphModel graphModel = Lookup.getDefault().lookup(GraphController.class).getGraphModel();

        DirectedGraph directedGraph = graphModel.getDirectedGraph();
        Node firstNode = graphModel.factory().newNode("0");
        directedGraph.addNode(firstNode);
        for (int i = 1; i <= 5; i++) {
            Node currentNode = graphModel.factory().newNode(((Integer) i).toString());
            directedGraph.addNode(currentNode);
            Edge currentEdge = graphModel.factory().newEdge(firstNode, currentNode);
            directedGraph.addEdge(currentEdge);
        }

        DirectedGraph hgraph = graphModel.getDirectedGraph();
        EigenvectorCentrality ec = new EigenvectorCentrality();

        double[] centralities = new double[6];

        HashMap<Integer, Node> indicies = new HashMap();
        HashMap<Node, Integer> invIndicies = new HashMap();

        ec.fillIndiciesMaps(hgraph, centralities, indicies, invIndicies);

        ec.calculateEigenvectorCentrality(hgraph, centralities, indicies, invIndicies, true, 100);

        Node n1 = hgraph.getNode("0");
        Node n2 = hgraph.getNode("1");
        int index1 = invIndicies.get(n1);
        int index2 = invIndicies.get(n2);
        double ec1 = centralities[index1];
        double ec2 = centralities[index2];
View Full Code Here
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
    }

    @Test
    public void testPathDirectedGraphEigenvectorCentrality() {
        GraphModel graphModel = GraphGenerator.generatePathDirectedGraph(4);
        DirectedGraph hgraph = graphModel.getDirectedGraph();

        EigenvectorCentrality ec = new EigenvectorCentrality();

        double[] centralities = new double[4];

        HashMap<Integer, Node> indicies = new HashMap();
        HashMap<Node, Integer> invIndicies = new HashMap();

        ec.fillIndiciesMaps(hgraph, centralities, indicies, invIndicies);

        ec.calculateEigenvectorCentrality(hgraph, centralities, indicies, invIndicies, true, 100);

        Node n1 = hgraph.getNode("0");
        Node n4 = hgraph.getNode("3");
        int index1 = invIndicies.get(n1);
        int index4 = invIndicies.get(n4);
        double ec1 = centralities[index1];
        double ec4 = centralities[index4];
View Full Code Here
146
147
148
149
150
151
152
153
154
155
    }

    @Test
    public void testDirectedPathGraphDensity() {
        GraphModel graphModel = GraphGenerator.generatePathDirectedGraph(2);
        DirectedGraph graph = graphModel.getDirectedGraph();
        GraphDensity d = new GraphDensity();
        double density = d.calculateDensity(graph, true);
        assertEquals(density, 0.5);
    }
View Full Code Here
155
156
157
158
159
160
161
162
163
164
    }

    @Test
    public void testDirectedCyclicGraphDensity() {
        GraphModel graphModel = GraphGenerator.generateCyclicDirectedGraph(5);
        DirectedGraph graph = graphModel.getDirectedGraph();
        GraphDensity d = new GraphDensity();
        double density = d.calculateDensity(graph, true);
        assertEquals(density, 0.25);
    }
View Full Code Here
164
165
166
167
168
169
170
171
172
173
    }

    @Test
    public void testDirectedCompleteGraphDensity() {
        GraphModel graphModel = GraphGenerator.generateCompleteDirectedGraph(5);
        DirectedGraph graph = graphModel.getDirectedGraph();
        GraphDensity d = new GraphDensity();
        double density = d.calculateDensity(graph, true);
        assertEquals(density, 1.0);
    }
View Full Code Here
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
    }

    @Test
    public void testDirectedCompleteGraphWithSelfLoopsDensity() {
        GraphModel graphModel = GraphGenerator.generateCompleteDirectedGraph(3);
        DirectedGraph directedGraph = graphModel.getDirectedGraph();
        Node n1 = directedGraph.getNode("0");
        Node n2 = directedGraph.getNode("1");
        Node n3 = directedGraph.getNode("2");
        Edge currentEdge = graphModel.factory().newEdge(n1, n1);
        directedGraph.addEdge(currentEdge);
        currentEdge = graphModel.factory().newEdge(n2, n2);
        directedGraph.addEdge(currentEdge);
        currentEdge = graphModel.factory().newEdge(n3, n3);
        directedGraph.addEdge(currentEdge);

        DirectedGraph graph = graphModel.getDirectedGraph();

        GraphDensity d = new GraphDensity();
        double density = d.calculateDensity(graph, true);
        assertEquals(density, 1.5);
    }
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
113
        return graphModel;
    }

    public static GraphModel generateNullDirectedGraph(int n) {
        GraphModel graphModel = Lookup.getDefault().lookup(GraphController.class).getGraphModel();
        DirectedGraph directedGraph = graphModel.getDirectedGraph();
        for (int i = 0; i < n; i++) {
            Node currentNode = graphModel.factory().newNode(((Integer) i).toString());
            directedGraph.addNode(currentNode);
        }
        return graphModel;
    }
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
        return graphModel;
    }

    public static GraphModel generateCompleteDirectedGraph(int n) {
        GraphModel graphModel = Lookup.getDefault().lookup(GraphController.class).getGraphModel();
        DirectedGraph directedGraph = graphModel.getDirectedGraph();
        Node[] nodes = new Node[n];
        for (int i = 0; i < n; i++) {
            Node currentNode = graphModel.factory().newNode(((Integer) i).toString());
            nodes[i] = currentNode;
            directedGraph.addNode(currentNode);
        }
        for (int i = 0; i < n - 1; i++) {
            for (int j = i + 1; j < n; j++) {
                Edge currentEdge = graphModel.factory().newEdge(nodes[i], nodes[j]);
                directedGraph.addEdge(currentEdge);
                currentEdge = graphModel.factory().newEdge(nodes[j], nodes[i]);
                directedGraph.addEdge(currentEdge);
            }
        }
        return graphModel;
    }
View Full Code Here
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
        return graphModel;
    }

    public static GraphModel generatePathDirectedGraph(int n) {
        GraphModel graphModel = Lookup.getDefault().lookup(GraphController.class).getGraphModel();
        DirectedGraph directedGraph = graphModel.getDirectedGraph();
        if (n <= 0) {
            return graphModel;
        }
        Node firstNode = graphModel.factory().newNode("0");
        directedGraph.addNode(firstNode);
        Node prevNode = firstNode;
        for (int i = 1; i < n; i++) {
            Node currentNode = graphModel.factory().newNode(((Integer) i).toString());
            directedGraph.addNode(currentNode);
            Edge currentEdge = graphModel.factory().newEdge(prevNode, currentNode);
            directedGraph.addEdge(currentEdge);
            prevNode = currentNode;
        }
        return graphModel;
    }
View Full Code Here
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
        return graphModel;
    }

    public static GraphModel generateCyclicDirectedGraph(int n) {
        GraphModel graphModel = Lookup.getDefault().lookup(GraphController.class).getGraphModel();
        DirectedGraph directedGraph = graphModel.getDirectedGraph();
        if (n <= 0) {
            return graphModel;
        }
        Node firstNode = graphModel.factory().newNode("0");
        directedGraph.addNode(firstNode);
        Node prevNode = firstNode;
        for (int i = 1; i < n; i++) {
            Node currentNode = graphModel.factory().newNode(((Integer) i).toString());
            directedGraph.addNode(currentNode);
            Edge currentEdge = graphModel.factory().newEdge(prevNode, currentNode);
            directedGraph.addEdge(currentEdge);
            prevNode = currentNode;
        }
        Edge currentEdge = graphModel.factory().newEdge(prevNode, firstNode);
        directedGraph.addEdge(currentEdge);
        return graphModel;
    }
View Full Code Here
TOP

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

  • org.gephi.io.exporter.plugin.ExporterCSV
  • org.gephi.plugins.example.filter.TransformToUndirectedFilter
  • org.gephi.ranking.impl.RankingModelImpl
  • org.gephi.statistics.plugin.ClusteringCoefficientNGTest
  • org.gephi.statistics.plugin.ConnectedComponents
  • org.gephi.statistics.plugin.ConnectedComponentsNGTest
  • org.gephi.statistics.plugin.Degree
  • org.gephi.statistics.plugin.DegreeNGTest
  • org.gephi.statistics.plugin.dynamic.DynamicDegree
  • org.gephi.statistics.plugin.EigenvectorCentralityNGTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.