use of org.gephi.graph.api.GraphModel in project gephi by gephi.
the class HitsNGTest method testDirectedStarOutGraphHits.
@Test
public void testDirectedStarOutGraphHits() {
GraphModel graphModel = Lookup.getDefault().lookup(GraphController.class).getGraphModel();
DirectedGraph directedGraph = graphModel.getDirectedGraph();
Node firstNode = graphModel.factory().newNode("0");
directedGraph.addNode(firstNode);
for (int i = 1; i <= 5; i++) {
Node currentNode = graphModel.factory().newNode(((Integer) i).toString());
directedGraph.addNode(currentNode);
Edge currentEdge = graphModel.factory().newEdge(firstNode, currentNode);
directedGraph.addEdge(currentEdge);
}
DirectedGraph graph = graphModel.getDirectedGraph();
Hits hit = new Hits();
double[] authority = new double[6];
double[] hubs = new double[6];
HashMap<Node, Integer> indices = hit.createIndicesMap(graph);
hit.calculateHits(graph, hubs, authority, indices, true, EPSILON);
Node n1 = graph.getNode("0");
Node n3 = graph.getNode("2");
int index1 = indices.get(n1);
int index3 = indices.get(n3);
double hub1 = hubs[index1];
double hub3 = hubs[index3];
double auth1 = authority[index1];
double auth3 = authority[index3];
assertEquals(hub1, 1.0);
assertEquals(auth1, 0.0);
assertEquals(hub3, 0.0);
assertEquals(auth3, 0.4472);
}
use of org.gephi.graph.api.GraphModel in project gephi by gephi.
the class GraphDistanceNGTest method testSpecial2UndirectedGraphRadius.
@Test
public void testSpecial2UndirectedGraphRadius() {
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");
Node node8 = graphModel.factory().newNode("7");
undirectedGraph.addNode(node1);
undirectedGraph.addNode(node2);
undirectedGraph.addNode(node3);
undirectedGraph.addNode(node4);
undirectedGraph.addNode(node5);
undirectedGraph.addNode(node6);
undirectedGraph.addNode(node7);
undirectedGraph.addNode(node8);
Edge edge12 = graphModel.factory().newEdge(node1, node2, false);
Edge edge23 = graphModel.factory().newEdge(node2, node3, false);
Edge edge34 = graphModel.factory().newEdge(node3, node4, false);
Edge edge45 = graphModel.factory().newEdge(node4, node5, false);
Edge edge56 = graphModel.factory().newEdge(node5, node6, false);
Edge edge67 = graphModel.factory().newEdge(node6, node7, false);
Edge edge78 = graphModel.factory().newEdge(node7, node8, false);
Edge edge81 = graphModel.factory().newEdge(node8, node1, false);
Edge edge14 = graphModel.factory().newEdge(node1, node4, false);
Edge edge85 = graphModel.factory().newEdge(node8, node5, false);
undirectedGraph.addEdge(edge12);
undirectedGraph.addEdge(edge23);
undirectedGraph.addEdge(edge34);
undirectedGraph.addEdge(edge45);
undirectedGraph.addEdge(edge56);
undirectedGraph.addEdge(edge67);
undirectedGraph.addEdge(edge78);
undirectedGraph.addEdge(edge81);
undirectedGraph.addEdge(edge14);
undirectedGraph.addEdge(edge85);
GraphDistance d = new GraphDistance();
d.initializeStartValues();
UndirectedGraph hierarchicalUndirectedGraph = graphModel.getUndirectedGraph();
HashMap<Node, Integer> indicies = d.createIndiciesMap(hierarchicalUndirectedGraph);
d.calculateDistanceMetrics(graphModel.getGraph(), indicies, false, false);
double radius = d.getRadius();
assertEquals(radius, 3.0, TOLERANCE);
}
use of org.gephi.graph.api.GraphModel in project gephi by gephi.
the class GraphDistanceNGTest method testTwoConnectrdNodesDiameter.
@Test
public void testTwoConnectrdNodesDiameter() {
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 diameter = d.getDiameter();
assertEquals(diameter, 1.0, TOLERANCE);
}
use of org.gephi.graph.api.GraphModel in project gephi by gephi.
the class GraphDistanceNGTest method testDirectedCyclicGraphHarmonicCloseness.
@Test
public void testDirectedCyclicGraphHarmonicCloseness() {
GraphModel graphModel = GraphGenerator.generateCyclicDirectedGraph(5);
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 n2 = directedGraph.getNode("1");
int index2 = indicies.get(n2);
assertEquals(harmonic[index2], (1.0 + 1.0 / 2.0 + 1.0 / 3.0 + 1.0 / 4.0) / 4.0, TOLERANCE);
}
use of org.gephi.graph.api.GraphModel in project gephi by gephi.
the class GraphDistanceNGTest method testCompleteGraphDiameter.
@Test
public void testCompleteGraphDiameter() {
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 diameter = d.getDiameter();
assertEquals(diameter, 1.0, TOLERANCE);
}
Aggregations