use of org.gephi.graph.api.Graph in project gephi by gephi.
the class ClusteringCoefficientNGTest method testSpecial3UndirectedGraphClusteringCoefficient.
@Test
public void testSpecial3UndirectedGraphClusteringCoefficient() {
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");
undirectedGraph.addNode(node1);
undirectedGraph.addNode(node2);
undirectedGraph.addNode(node3);
undirectedGraph.addNode(node4);
undirectedGraph.addNode(node5);
undirectedGraph.addNode(node6);
Edge edge12 = graphModel.factory().newEdge(node1, node2, false);
Edge edge23 = graphModel.factory().newEdge(node2, node3, false);
Edge edge31 = graphModel.factory().newEdge(node3, node1, false);
Edge edge14 = graphModel.factory().newEdge(node1, node4, false);
Edge edge25 = graphModel.factory().newEdge(node2, node5, false);
Edge edge36 = graphModel.factory().newEdge(node3, node6, false);
undirectedGraph.addEdge(edge12);
undirectedGraph.addEdge(edge23);
undirectedGraph.addEdge(edge31);
undirectedGraph.addEdge(edge14);
undirectedGraph.addEdge(edge25);
undirectedGraph.addEdge(edge36);
Graph graph = graphModel.getGraph();
ClusteringCoefficient cc = new ClusteringCoefficient();
ArrayWrapper[] network = new ArrayWrapper[6];
int[] triangles = new int[6];
double[] nodeClustering = new double[6];
HashMap<String, Double> results = cc.computeClusteringCoefficient(graph, network, triangles, nodeClustering, false);
double cl1 = nodeClustering[0];
double res1 = 0.333;
double diff = 0.01;
assertTrue(Math.abs(cl1 - res1) < diff);
}
use of org.gephi.graph.api.Graph in project gephi by gephi.
the class ClusteringCoefficientNGTest method testNullGraphClusteringCoefficient.
@Test
public void testNullGraphClusteringCoefficient() {
GraphModel graphModel = GraphGenerator.generateNullUndirectedGraph(5);
Graph graph = graphModel.getGraph();
ClusteringCoefficient cc = new ClusteringCoefficient();
cc.setDirected(false);
ArrayWrapper[] network = new ArrayWrapper[5];
int[] triangles = new int[5];
double[] nodeClustering = new double[5];
HashMap<String, Double> results = cc.computeClusteringCoefficient(graph, network, triangles, nodeClustering, false);
double avClusteringCoefficient = results.get("clusteringCoefficient");
assertEquals(avClusteringCoefficient, Double.NaN);
}
use of org.gephi.graph.api.Graph in project gephi by gephi.
the class ClusteringCoefficientNGTest method testCompleteGraphClusteringCoefficient.
@Test
public void testCompleteGraphClusteringCoefficient() {
GraphModel graphModel = GraphGenerator.generateCompleteUndirectedGraph(5);
Graph graph = graphModel.getGraph();
ClusteringCoefficient cc = new ClusteringCoefficient();
cc.setDirected(false);
ArrayWrapper[] network = new ArrayWrapper[5];
int[] triangles = new int[5];
double[] nodeClustering = new double[5];
HashMap<String, Double> results = cc.computeClusteringCoefficient(graph, network, triangles, nodeClustering, false);
double avClusteringCoefficient = results.get("clusteringCoefficient");
assertEquals(avClusteringCoefficient, 1.0);
}
use of org.gephi.graph.api.Graph in project gephi by gephi.
the class DegreeNGTest method testSelfLoopGraphDegree.
@Test
public void testSelfLoopGraphDegree() {
GraphModel graphModel = GraphGenerator.generateSelfLoopUndirectedGraph(1);
Graph graph = graphModel.getGraph();
Node n = graph.getNode("0");
Degree d = new Degree();
int degree = d.calculateDegree(graph, n);
assertEquals(degree, 2);
}
use of org.gephi.graph.api.Graph in project gephi by gephi.
the class DegreeNGTest method testCyclicGraphDegree.
@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);
}
Aggregations