Search in sources :

Example 56 with DirectedGraph

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

the class ConnectedComponentsNGTest method testDirectedCyclicGraphConnectedComponents.

@Test
public void testDirectedCyclicGraphConnectedComponents() {
    GraphModel graphModel = GraphGenerator.generateCyclicDirectedGraph(5);
    DirectedGraph graph = graphModel.getDirectedGraph();
    ConnectedComponents c = new ConnectedComponents();
    HashMap<Node, Integer> indicies = c.createIndiciesMap(graph);
    LinkedList<LinkedList<Node>> components = c.top_tarjans(graph, indicies);
    assertEquals(components.size(), 1);
}
Also used : DirectedGraph(org.gephi.graph.api.DirectedGraph) GraphModel(org.gephi.graph.api.GraphModel) Node(org.gephi.graph.api.Node) LinkedList(java.util.LinkedList) Test(org.testng.annotations.Test)

Example 57 with DirectedGraph

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

the class ConnectedComponentsNGTest method testSpecial4DirectedGraphConnectedComponents.

@Test
public void testSpecial4DirectedGraphConnectedComponents() {
    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);
    DirectedGraph graph = graphModel.getDirectedGraph();
    ConnectedComponents c = new ConnectedComponents();
    HashMap<Node, Integer> indicies = c.createIndiciesMap(graph);
    LinkedList<LinkedList<Node>> stronglyConnectedComponents = c.top_tarjans(graph, indicies);
    int componentNumber1 = c.getComponentNumber(stronglyConnectedComponents, node1);
    int componentNumber5 = c.getComponentNumber(stronglyConnectedComponents, node5);
    assertEquals(stronglyConnectedComponents.size(), 2);
    assertNotEquals(componentNumber1, componentNumber5);
}
Also used : DirectedGraph(org.gephi.graph.api.DirectedGraph) GraphModel(org.gephi.graph.api.GraphModel) Node(org.gephi.graph.api.Node) Edge(org.gephi.graph.api.Edge) GraphController(org.gephi.graph.api.GraphController) LinkedList(java.util.LinkedList) Test(org.testng.annotations.Test)

Example 58 with DirectedGraph

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

the class ConnectedComponentsNGTest method testSpecial2DirectedGraphConnectedComponents.

@Test
public void testSpecial2DirectedGraphConnectedComponents() {
    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 edge12 = graphModel.factory().newEdge(node1, node2);
    Edge edge14 = graphModel.factory().newEdge(node1, node4);
    Edge edge23 = graphModel.factory().newEdge(node2, node3);
    Edge edge25 = graphModel.factory().newEdge(node2, node5);
    Edge edge35 = graphModel.factory().newEdge(node3, node5);
    Edge edge43 = graphModel.factory().newEdge(node4, node3);
    Edge edge54 = graphModel.factory().newEdge(node5, node4);
    directedGraph.addEdge(edge12);
    directedGraph.addEdge(edge14);
    directedGraph.addEdge(edge23);
    directedGraph.addEdge(edge25);
    directedGraph.addEdge(edge35);
    directedGraph.addEdge(edge43);
    directedGraph.addEdge(edge54);
    DirectedGraph graph = graphModel.getDirectedGraph();
    ConnectedComponents c = new ConnectedComponents();
    HashMap<Node, Integer> indicies = c.createIndiciesMap(graph);
    LinkedList<LinkedList<Node>> weeklyConnectedComponents = c.computeWeeklyConnectedComponents(graph, indicies);
    LinkedList<LinkedList<Node>> stronglyConnectedComponents = c.top_tarjans(graph, indicies);
    int componentNumber1 = c.getComponentNumber(stronglyConnectedComponents, node1);
    int componentNumber3 = c.getComponentNumber(stronglyConnectedComponents, node3);
    int componentNumber4 = c.getComponentNumber(stronglyConnectedComponents, node4);
    int componentNumber5 = c.getComponentNumber(stronglyConnectedComponents, node5);
    assertEquals(stronglyConnectedComponents.size(), 3);
    assertEquals(weeklyConnectedComponents.size(), 1);
    assertEquals(componentNumber3, componentNumber5);
    assertNotEquals(componentNumber1, componentNumber4);
}
Also used : DirectedGraph(org.gephi.graph.api.DirectedGraph) GraphModel(org.gephi.graph.api.GraphModel) Node(org.gephi.graph.api.Node) Edge(org.gephi.graph.api.Edge) GraphController(org.gephi.graph.api.GraphController) LinkedList(java.util.LinkedList) Test(org.testng.annotations.Test)

Example 59 with DirectedGraph

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

the class GraphDistanceNGTest method testDirectedStarOutGraphHarmonicCloseness.

@Test
public void testDirectedStarOutGraphHarmonicCloseness() {
    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[] harmonic = metricsMap.get(GraphDistance.HARMONIC_CLOSENESS);
    Node n1 = directedGraph.getNode("0");
    Node n6 = directedGraph.getNode("5");
    int index1 = indicies.get(n1);
    int index6 = indicies.get(n6);
    assertEquals(harmonic[index1], 1.0, TOLERANCE);
    assertEquals(harmonic[index6], 0.0, TOLERANCE);
}
Also used : HashMap(java.util.HashMap) Node(org.gephi.graph.api.Node) DirectedGraph(org.gephi.graph.api.DirectedGraph) GraphModel(org.gephi.graph.api.GraphModel) Edge(org.gephi.graph.api.Edge) GraphController(org.gephi.graph.api.GraphController) Test(org.testng.annotations.Test)

Example 60 with DirectedGraph

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

the class DegreeNGTest method testDirectedCyclicGraphDegree.

@Test
public void testDirectedCyclicGraphDegree() {
    GraphModel graphModel = GraphGenerator.generateCyclicDirectedGraph(5);
    DirectedGraph graph = graphModel.getDirectedGraph();
    Node n1 = graph.getNode("0");
    Node n3 = graph.getNode("2");
    Node n5 = graph.getNode("4");
    Degree d = new Degree();
    int inDegree3 = d.calculateInDegree(graph, n3);
    int degree1 = d.calculateDegree(graph, n1);
    int outDegree5 = d.calculateOutDegree(graph, n5);
    double avDegree = d.calculateAverageDegree(graph, true, false);
    assertEquals(inDegree3, 1);
    assertEquals(degree1, 2);
    assertEquals(outDegree5, 1);
    assertEquals(avDegree, 1.0);
}
Also used : DirectedGraph(org.gephi.graph.api.DirectedGraph) GraphModel(org.gephi.graph.api.GraphModel) Node(org.gephi.graph.api.Node) Test(org.testng.annotations.Test)

Aggregations

DirectedGraph (org.gephi.graph.api.DirectedGraph)64 Node (org.gephi.graph.api.Node)60 GraphModel (org.gephi.graph.api.GraphModel)57 Test (org.testng.annotations.Test)52 Edge (org.gephi.graph.api.Edge)37 GraphController (org.gephi.graph.api.GraphController)36 HashMap (java.util.HashMap)17 LinkedList (java.util.LinkedList)6 UndirectedGraph (org.gephi.graph.api.UndirectedGraph)6 Graph (org.gephi.graph.api.Graph)2 Color (java.awt.Color)1 DecimalFormat (java.text.DecimalFormat)1 Entry (java.util.Map.Entry)1 AbstractShortestPathAlgorithm (org.gephi.algorithms.shortestpath.AbstractShortestPathAlgorithm)1 BellmanFordShortestPathAlgorithm (org.gephi.algorithms.shortestpath.BellmanFordShortestPathAlgorithm)1 DijkstraShortestPathAlgorithm (org.gephi.algorithms.shortestpath.DijkstraShortestPathAlgorithm)1 Interval (org.gephi.graph.api.Interval)1 TimeRepresentation (org.gephi.graph.api.TimeRepresentation)1 NodeClickEventListener (org.gephi.tools.spi.NodeClickEventListener)1 LinearGradient (org.gephi.ui.utils.GradientUtils.LinearGradient)1