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

Example 56 with Node

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

the class GraphDistanceNGTest method testCompleteGraphCloseness.

@Test
public void testCompleteGraphCloseness() {
    GraphModel graphModel = GraphGenerator.generateCompleteUndirectedGraph(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[] closeness = metricsMap.get(GraphDistance.CLOSENESS);
    Node n1 = undirectedGraph.getNode("0");
    int index1 = indicies.get(n1);
    assertEquals(closeness[index1], 1.0, TOLERANCE);
}

Example 57 with Node

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

the class GraphDistanceNGTest method testCyclicGraphDiameter.

@Test
public void testCyclicGraphDiameter() {
    GraphModel graphModel = GraphGenerator.generateCyclicUndirectedGraph(5);
    GraphDistance d = new GraphDistance();
    d.initializeStartValues();
    UndirectedGraph undirectedGraph = graphModel.getUndirectedGraph();
    HashMap<Node, Integer> indicies = d.createIndiciesMap(undirectedGraph);
    d.calculateDistanceMetrics(graphModel.getGraph(), indicies, false, false);
    double diameter = d.getDiameter();
    assertEquals(diameter, 2.0, TOLERANCE);
}

Example 58 with Node

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

the class GraphDistanceNGTest method testTwoConnectedNodesAvPathLength.

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

Example 59 with Node

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

the class GraphDistanceNGTest method testCyclic5GraphBetweenness.

@Test
public void testCyclic5GraphBetweenness() {
    GraphModel graphModel = GraphGenerator.generateCyclicUndirectedGraph(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[] betweenness = metricsMap.get(GraphDistance.BETWEENNESS);
    Node n4 = undirectedGraph.getNode("3");
    int index4 = indicies.get(n4);
    assertEquals(betweenness[index4], 1.0, TOLERANCE);
}

Example 60 with Node

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

the class GraphDistanceNGTest method testCompleteGraphRadius.

@Test
public void testCompleteGraphRadius() {
    GraphModel graphModel = GraphGenerator.generateCompleteUndirectedGraph(5);
    GraphDistance d = new GraphDistance();
    d.initializeStartValues();
    UndirectedGraph undirectedGraph = graphModel.getUndirectedGraph();
    HashMap<Node, Integer> indicies = d.createIndiciesMap(undirectedGraph);
    d.calculateDistanceMetrics(graphModel.getGraph(), indicies, false, false);
    double radius = d.getRadius();
    assertEquals(radius, 1.0, TOLERANCE);
}