use of org.gephi.graph.api.Graph in project gephi by gephi.
the class DegreeNGTest method testNullGraphDegree.
@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);
}
use of org.gephi.graph.api.Graph in project gephi by gephi.
the class DegreeNGTest method testStarGraphDegree.
@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;
double diff = Math.abs(avDegree - expectedAvDegree);
assertEquals(degree1, 5);
assertEquals(degree2, 1);
assertTrue(diff < 0.001);
}
use of org.gephi.graph.api.Graph in project gephi by gephi.
the class EigenvectorCentrality method execute.
/**
*
* @param graphModel
*/
@Override
public void execute(GraphModel graphModel) {
isDirected = graphModel.isDirected();
isCanceled = false;
Graph graph;
if (isDirected) {
graph = graphModel.getDirectedGraphVisible();
} else {
graph = graphModel.getUndirectedGraphVisible();
}
execute(graph);
}
use of org.gephi.graph.api.Graph in project gephi by gephi.
the class ClusteringCoefficientNGTest method testStarGraphClusteringCoefficient.
@Test
public void testStarGraphClusteringCoefficient() {
GraphModel graphModel = GraphGenerator.generateStarUndirectedGraph(5);
Graph graph = graphModel.getGraph();
ClusteringCoefficient cc = new ClusteringCoefficient();
cc.setDirected(false);
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 avClusteringCoefficient = results.get("clusteringCoefficient");
assertEquals(avClusteringCoefficient, 0.0);
}
use of org.gephi.graph.api.Graph in project gephi by gephi.
the class DegreeNGTest method testOneNodeDegree.
@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);
}
Aggregations