Package org.gephi.graph.api

Examples of org.gephi.graph.api.Graph

479
480
481
482
483
484
485
486
487
488
489
490
491
    public boolean isNodeInGraph(Node node) {
        return getGraph().contains(node);
    }

    public boolean areNodesInGraph(Node[] nodes) {
        Graph graph = getGraph();
        for (Node n : nodes) {
            if (!graph.contains(n)) {
                return false;
            }
        }
        return true;
    }
View Full Code Here
493
494
495
496
497
498
499
500
501
502
503
504
505
    public boolean isEdgeInGraph(Edge edge) {
        return getGraph().contains(edge);
    }

    public boolean areEdgesInGraph(Edge[] edges) {
        Graph graph = getGraph();
        for (Edge e : edges) {
            if (!graph.contains(e)) {
                return false;
            }
        }
        return true;
    }
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
54
    }

    @Test
    public void testOneNodeDegree() {
        GraphModel graphModel = GraphGenerator.generateNullUndirectedGraph(1);
        Graph graph = graphModel.getGraph();
        Node n = graph.getNode("0");

        Degree d = new Degree();
        int degree = d.calculateDegree(graph, n);
        assertEquals(degree, 0);
    }
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
65
    }

    @Test
    public void testNullGraphDegree() {
        GraphModel graphModel = GraphGenerator.generateNullUndirectedGraph(5);
        Graph graph = graphModel.getGraph();
        Node n = graph.getNode("1");
        Degree d = new Degree();
        int degree = d.calculateDegree(graph, n);
        double avDegree = d.calculateAverageDegree(graph, false, false);
        assertEquals(degree, 0);
        assertEquals(avDegree, 0.0);
View Full Code Here
66
67
68
69
70
71
72
73
74
75
76
    }

    @Test
    public void testCompleteGraphDegree() {
        GraphModel graphModel = GraphGenerator.generateCompleteUndirectedGraph(5);
        Graph graph = graphModel.getGraph();
        Node n = graph.getNode("2");
        Degree d = new Degree();
        int degree = d.calculateDegree(graph, n);
        assertEquals(degree, 4);
    }
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
87
88
    }

    @Test
    public void testStarGraphDegree() {
        GraphModel graphModel = GraphGenerator.generateStarUndirectedGraph(5);
        Graph graph = graphModel.getGraph();
        Node n1 = graph.getNode("0");
        Node n2 = graph.getNode("1");
        Degree d = new Degree();
        int degree1 = d.calculateDegree(graph, n1);
        int degree2 = d.calculateDegree(graph, n2);
        double avDegree = d.calculateAverageDegree(graph, false, false);
        double expectedAvDegree = 1.6667;
View Full Code Here
93
94
95
96
97
98
99
100
101
102
103
104
    }

    @Test
    public void testCyclicGraphDegree() {
        GraphModel graphModel = GraphGenerator.generateCyclicUndirectedGraph(5);
        Graph graph = graphModel.getGraph();
        Node n = graph.getNode("3");
        Degree d = new Degree();
        int degree = d.calculateDegree(graph, n);
        double avDegree = d.calculateAverageDegree(graph, false, false);
        assertEquals(degree, 2);
        assertEquals(avDegree, 2.0);
View Full Code Here
46
47
48
49
50
51
52
53
54
55
56
    }
   
    @Test
    public void testOneNodeClusteringCoefficient() {
        GraphModel graphModel=GraphGenerator.generateCompleteUndirectedGraph(1);
        Graph hgraph = graphModel.getGraph();

        ClusteringCoefficient cc = new ClusteringCoefficient();
        ArrayWrapper[] network = new ArrayWrapper[1];
        int[] triangles = new int[1];
        double[] nodeClustering = new double[1];
View Full Code Here
63
64
65
66
67
68
69
70
71
72
73
    }
   
    @Test
    public void testTwoConectedNodesClusteringCoefficient() {
        GraphModel graphModel=GraphGenerator.generateCompleteUndirectedGraph(2);
        Graph hgraph = graphModel.getGraph();

        ClusteringCoefficient cc = new ClusteringCoefficient();
        ArrayWrapper[] network = new ArrayWrapper[2];
        int[] triangles = new int[2];
        double[] nodeClustering = new double[2];
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
    }
   
    @Test
    public void testNullGraphClusteringCoefficient() {
        GraphModel graphModel=GraphGenerator.generateNullUndirectedGraph(5);
        Graph hgraph = graphModel.getGraph();

        ClusteringCoefficient cc = new ClusteringCoefficient();
        ArrayWrapper[] network = new ArrayWrapper[5];
        int[] triangles = new int[5];
        double[] nodeClustering = new double[5];
View Full Code Here
TOP

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

  • org.gephi.clustering.plugin.mcl.MarkovClustering
  • org.gephi.datalab.impl.AttributeColumnsControllerImpl
  • org.gephi.datalab.impl.GraphElementsControllerImpl
  • org.gephi.desktop.context.ContextPanel$RefreshRunnable
  • org.gephi.desktop.ranking.ResultListPanel
  • org.gephi.dynamic.DynamicGraphImpl
  • org.gephi.dynamic.DynamicGraphImplTest
  • org.gephi.dynamic.DynamicModelImpl
  • org.gephi.filters.FilterControllerImpl
  • org.gephi.filters.FilterModelPersistenceProvider
    • 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.