use of org.gephi.graph.api.DirectedGraph in project gephi by gephi.
the class PageRankNGTest method testDirectedSpecial1GraphPageRank.
@Test
public void testDirectedSpecial1GraphPageRank() {
pc.newProject();
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");
Node node6 = graphModel.factory().newNode("5");
Node node7 = graphModel.factory().newNode("6");
Node node8 = graphModel.factory().newNode("7");
Node node9 = graphModel.factory().newNode("8");
directedGraph.addNode(node1);
directedGraph.addNode(node2);
directedGraph.addNode(node3);
directedGraph.addNode(node4);
directedGraph.addNode(node5);
directedGraph.addNode(node6);
directedGraph.addNode(node7);
directedGraph.addNode(node8);
directedGraph.addNode(node9);
Edge edge12 = graphModel.factory().newEdge(node1, node2);
Edge edge23 = graphModel.factory().newEdge(node2, node3);
Edge edge31 = graphModel.factory().newEdge(node3, node1);
Edge edge14 = graphModel.factory().newEdge(node1, node4);
Edge edge45 = graphModel.factory().newEdge(node4, node5);
Edge edge51 = graphModel.factory().newEdge(node5, node1);
Edge edge16 = graphModel.factory().newEdge(node1, node6);
Edge edge67 = graphModel.factory().newEdge(node6, node7);
Edge edge71 = graphModel.factory().newEdge(node7, node1);
Edge edge18 = graphModel.factory().newEdge(node1, node8);
Edge edge89 = graphModel.factory().newEdge(node8, node9);
Edge edge91 = graphModel.factory().newEdge(node9, node1);
directedGraph.addEdge(edge12);
directedGraph.addEdge(edge23);
directedGraph.addEdge(edge31);
directedGraph.addEdge(edge14);
directedGraph.addEdge(edge45);
directedGraph.addEdge(edge51);
directedGraph.addEdge(edge16);
directedGraph.addEdge(edge67);
directedGraph.addEdge(edge71);
directedGraph.addEdge(edge18);
directedGraph.addEdge(edge89);
directedGraph.addEdge(edge91);
DirectedGraph graph = graphModel.getDirectedGraph();
PageRank pr = new PageRank();
double[] pageRank;
HashMap<Node, Integer> indicies = pr.createIndiciesMap(graph);
pageRank = pr.calculatePagerank(graph, indicies, true, false, 0.001, 0.85);
int index1 = indicies.get(node1);
int index2 = indicies.get(node2);
int index3 = indicies.get(node3);
double pr1 = pageRank[index1];
double pr2 = pageRank[index2];
double pr3 = pageRank[index3];
assertTrue(pr1 > pr2);
assertTrue(pr2 < pr3);
}
use of org.gephi.graph.api.DirectedGraph in project gephi by gephi.
the class GraphDistanceNGTest method testSpecial1DirectedGraphDiameter.
@Test
public void testSpecial1DirectedGraphDiameter() {
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");
Node node6 = graphModel.factory().newNode("5");
Node node7 = graphModel.factory().newNode("6");
Node node8 = graphModel.factory().newNode("7");
directedGraph.addNode(node1);
directedGraph.addNode(node2);
directedGraph.addNode(node3);
directedGraph.addNode(node4);
directedGraph.addNode(node5);
directedGraph.addNode(node6);
directedGraph.addNode(node7);
directedGraph.addNode(node8);
Edge edge12 = graphModel.factory().newEdge(node1, node2);
Edge edge23 = graphModel.factory().newEdge(node2, node3);
Edge edge34 = graphModel.factory().newEdge(node3, node4);
Edge edge41 = graphModel.factory().newEdge(node4, node1);
Edge edge56 = graphModel.factory().newEdge(node5, node6);
Edge edge67 = graphModel.factory().newEdge(node6, node7);
Edge edge78 = graphModel.factory().newEdge(node7, node8);
Edge edge85 = graphModel.factory().newEdge(node8, node5);
Edge edge45 = graphModel.factory().newEdge(node4, node5);
directedGraph.addEdge(edge12);
directedGraph.addEdge(edge23);
directedGraph.addEdge(edge34);
directedGraph.addEdge(edge41);
directedGraph.addEdge(edge56);
directedGraph.addEdge(edge67);
directedGraph.addEdge(edge78);
directedGraph.addEdge(edge85);
directedGraph.addEdge(edge45);
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 diameter = d.getDiameter();
assertEquals(diameter, 7.0, TOLERANCE);
}
use of org.gephi.graph.api.DirectedGraph in project gephi by gephi.
the class GraphDistanceNGTest method testDirectedSpecial1GraphAvPathLength.
@Test
public void testDirectedSpecial1GraphAvPathLength() {
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 edge15 = graphModel.factory().newEdge(node1, node5);
Edge edge52 = graphModel.factory().newEdge(node5, node2);
Edge edge53 = graphModel.factory().newEdge(node5, node3);
Edge edge45 = graphModel.factory().newEdge(node4, node5);
directedGraph.addEdge(edge15);
directedGraph.addEdge(edge52);
directedGraph.addEdge(edge53);
directedGraph.addEdge(edge45);
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, 1.5, TOLERANCE);
}
use of org.gephi.graph.api.DirectedGraph in project gephi by gephi.
the class GraphDistanceNGTest method testDirectedStarOutGraphBetweenness.
@Test
public void testDirectedStarOutGraphBetweenness() {
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);
}
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[] betweenness = metricsMap.get(GraphDistance.BETWEENNESS);
Node n1 = directedGraph.getNode("0");
Node n5 = directedGraph.getNode("4");
int index1 = indicies.get(n1);
int index5 = indicies.get(n5);
assertEquals(betweenness[index1], 0.0, TOLERANCE);
assertEquals(betweenness[index5], 0.0, TOLERANCE);
}
use of org.gephi.graph.api.DirectedGraph in project gephi by gephi.
the class GraphDistanceNGTest method testDirectedStarOutGraphAvPathLength.
@Test
public void testDirectedStarOutGraphAvPathLength() {
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);
}
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, 1.0, TOLERANCE);
}
Aggregations