Examples with Graph org.gephi.graph.api.Graph used on opensource projects

Example 96 with Graph

use of org.gephi.graph.api.Graph in project gephi by gephi.

the class ClusteringCoefficientNGTest method testSpecial2UndirectedGraphClusteringCoefficient.

@Test
public void testSpecial2UndirectedGraphClusteringCoefficient() {
    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 edge23 = graphModel.factory().newEdge(node2, node3, false);
    Edge edge31 = graphModel.factory().newEdge(node3, node1, false);
    Edge edge14 = graphModel.factory().newEdge(node1, node4, false);
    Edge edge45 = graphModel.factory().newEdge(node4, node5, false);
    Edge edge51 = graphModel.factory().newEdge(node5, node1, false);
    Edge edge16 = graphModel.factory().newEdge(node1, node6, false);
    Edge edge67 = graphModel.factory().newEdge(node6, node7, false);
    Edge edge71 = graphModel.factory().newEdge(node7, node1, false);
    undirectedGraph.addEdge(edge12);
    undirectedGraph.addEdge(edge23);
    undirectedGraph.addEdge(edge31);
    undirectedGraph.addEdge(edge14);
    undirectedGraph.addEdge(edge45);
    undirectedGraph.addEdge(edge51);
    undirectedGraph.addEdge(edge16);
    undirectedGraph.addEdge(edge67);
    undirectedGraph.addEdge(edge71);
    Graph graph = graphModel.getGraph();
    ClusteringCoefficient cc = new ClusteringCoefficient();
    ArrayWrapper[] network = new ArrayWrapper[7];
    int[] triangles = new int[7];
    double[] nodeClustering = new double[7];
    HashMap<String, Double> results = cc.computeClusteringCoefficient(graph, network, triangles, nodeClustering, false);
    double cl2 = nodeClustering[1];
    double avClusteringCoefficient = results.get("clusteringCoefficient");
    double resAv = 0.8857;
    double diff = 0.01;
    assertEquals(cl2, 1.0);
    assertTrue(Math.abs(avClusteringCoefficient - resAv) < diff);
}

Example 97 with Graph

use of org.gephi.graph.api.Graph in project gephi by gephi.

the class PageRank method execute.

@Override
public void execute(GraphModel graphModel) {
    Graph graph;
    if (isDirected) {
        graph = graphModel.getDirectedGraphVisible();
    } else {
        graph = graphModel.getUndirectedGraphVisible();
    }
    execute(graph);
}

Example 98 with Graph

use of org.gephi.graph.api.Graph in project gephi by gephi.

the class DegreeNGTest method testCompleteGraphDegree.

@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);
}

Example 99 with Graph

use of org.gephi.graph.api.Graph in project gephi by gephi.

the class GraphDensityNGTest method testOneNodeDensity.

@Test
public void testOneNodeDensity() {
    GraphModel graphModel = GraphGenerator.generateNullUndirectedGraph(1);
    Graph graph = graphModel.getGraph();
    GraphDensity d = new GraphDensity();
    double density = d.calculateDensity(graph, false);
    assertEquals(density, Double.NaN);
}

Example 100 with Graph

use of org.gephi.graph.api.Graph in project gephi by gephi.

the class GraphDensityNGTest method testCompleteGraphWithSelfLoopsDensity.

@Test
public void testCompleteGraphWithSelfLoopsDensity() {
    GraphModel graphModel = GraphGenerator.generateCompleteUndirectedGraph(3);
    UndirectedGraph undirectedGraph = graphModel.getUndirectedGraph();
    Node n1 = undirectedGraph.getNode("0");
    Node n2 = undirectedGraph.getNode("1");
    Node n3 = undirectedGraph.getNode("2");
    Edge currentEdge = graphModel.factory().newEdge(n1, n1, false);
    undirectedGraph.addEdge(currentEdge);
    currentEdge = graphModel.factory().newEdge(n2, n2, false);
    undirectedGraph.addEdge(currentEdge);
    currentEdge = graphModel.factory().newEdge(n3, n3, false);
    undirectedGraph.addEdge(currentEdge);
    Graph graph = graphModel.getGraph();
    GraphDensity d = new GraphDensity();
    double density = d.calculateDensity(graph, false);
    assertEquals(density, 2.0);
}