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

Example 71 with Node

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

the class GraphDistanceNGTest method testNullGraphHarmonicCloseness.

@Test
public void testNullGraphHarmonicCloseness() {
    GraphModel graphModel = GraphGenerator.generateNullUndirectedGraph(5);
    GraphDistance d = new GraphDistance();
    d.initializeStartValues();
    UndirectedGraph undirectedGraph = graphModel.getUndirectedGraph();
    HashMap<Node, Integer> indicies = d.createIndiciesMap(undirectedGraph);
    HashMap<String, double[]> metricsMap = (HashMap) d.calculateDistanceMetrics(graphModel.getGraph(), indicies, false, false);
    double[] harmonic = metricsMap.get(GraphDistance.HARMONIC_CLOSENESS);
    Node n1 = undirectedGraph.getNode("0");
    int index1 = indicies.get(n1);
    assertEquals(harmonic[index1], 0.0, TOLERANCE);
}

Example 72 with Node

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

the class GraphDistanceNGTest method testSpecial1DirectedGraphHarmonicCloseness.

@Test
public void testSpecial1DirectedGraphHarmonicCloseness() {
    GraphModel graphModel = Lookup.getDefault().lookup(GraphController.class).getGraphModel();
    DirectedGraph directedGraph = graphModel.getDirectedGraph();
    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");
    directedGraph.addNode(node1);
    directedGraph.addNode(node2);
    directedGraph.addNode(node3);
    directedGraph.addNode(node4);
    directedGraph.addNode(node5);
    Edge edge13 = graphModel.factory().newEdge(node1, node3);
    Edge edge32 = graphModel.factory().newEdge(node3, node2);
    Edge edge21 = graphModel.factory().newEdge(node2, node1);
    Edge edge34 = graphModel.factory().newEdge(node3, node4);
    Edge edge45 = graphModel.factory().newEdge(node4, node5);
    Edge edge53 = graphModel.factory().newEdge(node5, node3);
    directedGraph.addEdge(edge13);
    directedGraph.addEdge(edge32);
    directedGraph.addEdge(edge21);
    directedGraph.addEdge(edge34);
    directedGraph.addEdge(edge45);
    directedGraph.addEdge(edge53);
    GraphDistance d = new GraphDistance();
    d.initializeStartValues();
    HashMap<Node, Integer> indicies = d.createIndiciesMap(graphModel.getGraph());
    HashMap<String, double[]> metricsMap = (HashMap) d.calculateDistanceMetrics(graphModel.getGraph(), indicies, true, false);
    double[] harmonic = metricsMap.get(GraphDistance.HARMONIC_CLOSENESS);
    int index2 = indicies.get(node2);
    int index3 = indicies.get(node3);
    assertEquals(harmonic[index2], (1.0 + 1.0 / 2.0 + 1.0 / 3.0 + 1.0 / 4.0) / 4.0, TOLERANCE);
    assertEquals(harmonic[index3], (1.0 / 2.0 + 1.0 + 1.0 + 1.0 / 2.0) / 4.0, TOLERANCE);
}

Example 73 with Node

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

the class GraphDistanceNGTest method testTwoConnectedNodesBetweenness.

@Test
public void testTwoConnectedNodesBetweenness() {
    GraphModel graphModel = GraphGenerator.generatePathUndirectedGraph(2);
    GraphDistance d = new GraphDistance();
    d.initializeStartValues();
    UndirectedGraph undirectedGraph = graphModel.getUndirectedGraph();
    HashMap<Node, Integer> indicies = d.createIndiciesMap(undirectedGraph);
    HashMap<String, double[]> metricsMap = (HashMap) d.calculateDistanceMetrics(graphModel.getGraph(), indicies, false, false);
    double[] betweenness = metricsMap.get(GraphDistance.BETWEENNESS);
    Node n1 = undirectedGraph.getNode("0");
    int index1 = indicies.get(n1);
    assertEquals(betweenness[index1], 0.0, TOLERANCE);
}

Example 74 with Node

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

the class GraphDistanceNGTest method testDirectedPathGraphHarmonicCloseness.

@Test
public void testDirectedPathGraphHarmonicCloseness() {
    GraphModel graphModel = GraphGenerator.generatePathDirectedGraph(4);
    GraphDistance d = new GraphDistance();
    d.initializeStartValues();
    DirectedGraph directedGraph = graphModel.getDirectedGraph();
    HashMap<Node, Integer> indicies = d.createIndiciesMap(graphModel.getGraph());
    HashMap<String, double[]> metricsMap = (HashMap) d.calculateDistanceMetrics(graphModel.getGraph(), indicies, true, false);
    double[] harmonic = metricsMap.get(GraphDistance.HARMONIC_CLOSENESS);
    Node n1 = directedGraph.getNode("0");
    Node n3 = directedGraph.getNode("2");
    int index1 = indicies.get(n1);
    int index3 = indicies.get(n3);
    assertEquals(harmonic[index1], (1.0 + 1.0 / 2.0 + 1.0 / 3.0) / 3.0, TOLERANCE);
    assertEquals(harmonic[index3], 1.0, TOLERANCE);
}

Example 75 with Node

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

the class GraphDistanceNGTest method testDirectedCyclicGraphAvPathLength.

@Test
public void testDirectedCyclicGraphAvPathLength() {
    GraphModel graphModel = GraphGenerator.generateCyclicDirectedGraph(5);
    GraphDistance d = new GraphDistance();
    d.initializeStartValues();
    UndirectedGraph undirectedGraph = graphModel.getUndirectedGraph();
    HashMap<Node, Integer> indicies = d.createIndiciesMap(undirectedGraph);
    d.calculateDistanceMetrics(graphModel.getGraph(), indicies, true, false);
    double averageDegree = d.getPathLength();
    assertEquals(averageDegree, 2.5, TOLERANCE);
}