Package org.gephi.graph.api

Examples of org.gephi.graph.api.GraphModel

1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
        assertEquals(closeness[index3], 1.5);
    }

    @Test
    public void testSpecial1UndirectedGraphBetweenness() {
        GraphModel graphModel = Lookup.getDefault().lookup(GraphController.class).getGraphModel();
        UndirectedGraph undirectedGraph = graphModel.getUndirectedGraph();
        Node node1 = graphModel.factory().newNode("0");
        Node node2 = graphModel.factory().newNode("1");
        Node node3 = graphModel.factory().newNode("2");
        Node node4 = graphModel.factory().newNode("3");
        Node node5 = graphModel.factory().newNode("4");
        Node node6 = graphModel.factory().newNode("5");
        Node node7 = graphModel.factory().newNode("6");
        undirectedGraph.addNode(node1);
        undirectedGraph.addNode(node2);
        undirectedGraph.addNode(node3);
        undirectedGraph.addNode(node4);
        undirectedGraph.addNode(node5);
        undirectedGraph.addNode(node6);
        undirectedGraph.addNode(node7);
        Edge edge12 = graphModel.factory().newEdge(node1, node2, false);
        Edge edge13 = graphModel.factory().newEdge(node1, node3, false);
        Edge edge14 = graphModel.factory().newEdge(node1, node4, false);
        Edge edge15 = graphModel.factory().newEdge(node1, node5, false);
        Edge edge16 = graphModel.factory().newEdge(node1, node6, false);
        Edge edge27 = graphModel.factory().newEdge(node2, node7, false);
        Edge edge37 = graphModel.factory().newEdge(node3, node7, false);
        Edge edge47 = graphModel.factory().newEdge(node4, node7, false);
        Edge edge57 = graphModel.factory().newEdge(node5, node7, false);
        Edge edge67 = graphModel.factory().newEdge(node6, node7, false);
        undirectedGraph.addEdge(edge12);
        undirectedGraph.addEdge(edge13);
        undirectedGraph.addEdge(edge14);
        undirectedGraph.addEdge(edge15);
        undirectedGraph.addEdge(edge16);
        undirectedGraph.addEdge(edge27);
        undirectedGraph.addEdge(edge37);
        undirectedGraph.addEdge(edge47);
        undirectedGraph.addEdge(edge57);
        undirectedGraph.addEdge(edge67);

        GraphDistance d = new GraphDistance();
        d.initializeStartValues();
        UndirectedGraph hierarchicalUndirectedGraph = graphModel.getUndirectedGraph();
        HashMap<Node, Integer> indicies = d.createIndiciesMap(hierarchicalUndirectedGraph);

        HashMap<String, double[]> metricsMap = (HashMap) d.calculateDistanceMetrics(graphModel.getGraph(), indicies, false, false);
        double[] betweenness = metricsMap.get(GraphDistance.BETWEENNESS);

        int index1 = indicies.get(node1);
        int index3 = indicies.get(node3);
View Full Code Here
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
        assertEquals(betweenness[index3], 0.2);
    }

    @Test
    public void testSpecial1UndirectedGraphCloseness() {
        GraphModel graphModel = Lookup.getDefault().lookup(GraphController.class).getGraphModel();
        UndirectedGraph undirectedGraph = graphModel.getUndirectedGraph();
        Node node1 = graphModel.factory().newNode("0");
        Node node2 = graphModel.factory().newNode("1");
        Node node3 = graphModel.factory().newNode("2");
        Node node4 = graphModel.factory().newNode("3");
        Node node5 = graphModel.factory().newNode("4");
        Node node6 = graphModel.factory().newNode("5");
        Node node7 = graphModel.factory().newNode("6");
        undirectedGraph.addNode(node1);
        undirectedGraph.addNode(node2);
        undirectedGraph.addNode(node3);
        undirectedGraph.addNode(node4);
        undirectedGraph.addNode(node5);
        undirectedGraph.addNode(node6);
        undirectedGraph.addNode(node7);
        Edge edge12 = graphModel.factory().newEdge(node1, node2, false);
        Edge edge13 = graphModel.factory().newEdge(node1, node3, false);
        Edge edge14 = graphModel.factory().newEdge(node1, node4, false);
        Edge edge15 = graphModel.factory().newEdge(node1, node5, false);
        Edge edge16 = graphModel.factory().newEdge(node1, node6, false);
        Edge edge27 = graphModel.factory().newEdge(node2, node7, false);
        Edge edge37 = graphModel.factory().newEdge(node3, node7, false);
        Edge edge47 = graphModel.factory().newEdge(node4, node7, false);
        Edge edge57 = graphModel.factory().newEdge(node5, node7, false);
        Edge edge67 = graphModel.factory().newEdge(node6, node7, false);
        undirectedGraph.addEdge(edge12);
        undirectedGraph.addEdge(edge13);
        undirectedGraph.addEdge(edge14);
        undirectedGraph.addEdge(edge15);
        undirectedGraph.addEdge(edge16);
        undirectedGraph.addEdge(edge27);
        undirectedGraph.addEdge(edge37);
        undirectedGraph.addEdge(edge47);
        undirectedGraph.addEdge(edge57);
        undirectedGraph.addEdge(edge67);

        GraphDistance d = new GraphDistance();
        d.initializeStartValues();
        UndirectedGraph hierarchicalUndirectedGraph = graphModel.getUndirectedGraph();
        HashMap<Node, Integer> indicies = d.createIndiciesMap(hierarchicalUndirectedGraph);

        HashMap<String, double[]> metricsMap = (HashMap) d.calculateDistanceMetrics(graphModel.getGraph(), indicies, false, false);
        double[] closeness = metricsMap.get(GraphDistance.CLOSENESS);

        int index7 = indicies.get(node7);

        double res = 1.1667;
View Full Code Here
72
73
74
75
76
77
78
79
80
    }

    @Override
    public Ranking[] buildRanking(RankingModel model) {
        Workspace workspace = model.getWorkspace();
        GraphModel graphModel = graphController.getGraphModel(workspace);

        return new Ranking[]{new DegreeRanking(Ranking.NODE_ELEMENT, graphModel, model)};
    }
View Full Code Here
136
137
138
139
140
141
142
143
            return minimum;
        }

        @Override
        protected DegreeRanking clone() {
            GraphModel graphModel = graph.getView().getGraphModel();
            return new DegreeRanking(elementType, graphModel, rankingModel);
        }
View Full Code Here
45
46
47
48
49
50
51
52
53
54
55
56
        pc.closeCurrentProject();
    }
   
    @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
62
63
64
65
66
67
68
69
70
71
72
73
        assertEquals(avClusteringCoefficient, Double.NaN);
    }
   
    @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
79
80
81
82
83
84
85
86
87
88
89
90
        assertEquals(avClusteringCoefficient, Double.NaN);
    }
   
    @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
96
97
98
99
100
101
102
103
104
105
106
107
        assertEquals(avClusteringCoefficient, Double.NaN);
    }
   
   @Test
    public void testCompleteGraphClusteringCoefficient() {
        GraphModel graphModel=GraphGenerator.generateCompleteUndirectedGraph(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
112
113
114
115
116
117
118
119
120
121
122
123
        assertEquals(avClusteringCoefficient, 1.0);
    }
  
   @Test
    public void testStarGraphClusteringCoefficient() {
        GraphModel graphModel=GraphGenerator.generateStarUndirectedGraph(5);
        Graph hgraph = graphModel.getGraph();

        ClusteringCoefficient cc = new ClusteringCoefficient();
        ArrayWrapper[] network = new ArrayWrapper[6];
        int[] triangles = new int[6];
        double[] nodeClustering = new double[6];
View Full Code Here
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
    }
 
  
   @Test
    public void testSpecial1UndirectedGraphClusteringCoefficient() {
        GraphModel graphModel=Lookup.getDefault().lookup(GraphController.class).getGraphModel();
        UndirectedGraph undirectedGraph=graphModel.getUndirectedGraph();
        Node node1=graphModel.factory().newNode("0");
        Node node2=graphModel.factory().newNode("1");
        Node node3=graphModel.factory().newNode("2");
        Node node4=graphModel.factory().newNode("3");
        Node node5=graphModel.factory().newNode("4");
        Node node6=graphModel.factory().newNode("5");
        Node node7=graphModel.factory().newNode("6");
        undirectedGraph.addNode(node1);
        undirectedGraph.addNode(node2);
        undirectedGraph.addNode(node3);
        undirectedGraph.addNode(node4);
        undirectedGraph.addNode(node5);
        undirectedGraph.addNode(node6);
        undirectedGraph.addNode(node7);
        Edge edge12=graphModel.factory().newEdge(node1, node2, false);
        Edge edge13=graphModel.factory().newEdge(node1, node3, false);
        Edge edge14=graphModel.factory().newEdge(node1, node4, false);
        Edge edge15=graphModel.factory().newEdge(node1, node5, false);
        Edge edge16=graphModel.factory().newEdge(node1, node6, false);
        Edge edge17=graphModel.factory().newEdge(node1, node7, false);
        Edge edge23=graphModel.factory().newEdge(node2, node3, false);
        Edge edge34=graphModel.factory().newEdge(node3, node4, false);
        Edge edge45=graphModel.factory().newEdge(node4, node5, false);
        Edge edge56=graphModel.factory().newEdge(node5, node6, false);
        Edge edge67=graphModel.factory().newEdge(node6, node7, false);
        Edge edge72=graphModel.factory().newEdge(node7, node2, false);
        undirectedGraph.addEdge(edge12);
        undirectedGraph.addEdge(edge13);
        undirectedGraph.addEdge(edge14);
        undirectedGraph.addEdge(edge15);
        undirectedGraph.addEdge(edge16);
        undirectedGraph.addEdge(edge17);
        undirectedGraph.addEdge(edge23);
        undirectedGraph.addEdge(edge34);
        undirectedGraph.addEdge(edge45);
        undirectedGraph.addEdge(edge56);
        undirectedGraph.addEdge(edge67);
        undirectedGraph.addEdge(edge72);
       
        Graph hgraph = graphModel.getGraph();
        ClusteringCoefficient cc = new ClusteringCoefficient();

        ArrayWrapper[] network = new ArrayWrapper[7];
        int[] triangles = new int[7];
        double[] nodeClustering = new double[7];
View Full Code Here
TOP

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

  • bnGUI.util_GraphVisualizer
  • org.gephi.appearance.AppearanceControllerImpl
  • org.gephi.data.attributes.AttributeTableImpl
  • org.gephi.data.attributes.serialization.AttributeRowPersistenceProvider
  • org.gephi.datalab.plugin.manipulators.general.AddEdgeToGraph
  • org.gephi.datalab.plugin.manipulators.nodes.LinkNodes
  • org.gephi.desktop.clustering.ClusteringControllerImpl
  • org.gephi.desktop.context.ContextTopComponent
  • org.gephi.desktop.hierarchy.HierarchyControlPanel
  • org.gephi.desktop.hierarchy.HierarchyTopComponent
    • 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.