Search in sources :

Example 11 with GraphModel

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

the class DegreeNGTest method testDirectedPathGraphDegree.

@Test
public void testDirectedPathGraphDegree() {
    GraphModel graphModel = GraphGenerator.generatePathDirectedGraph(2);
    DirectedGraph graph = graphModel.getDirectedGraph();
    Node n1 = graph.getNode("0");
    Node n2 = graph.getNode("1");
    Degree d = new Degree();
    int inDegree1 = d.calculateInDegree(graph, n1);
    int inDegree2 = d.calculateInDegree(graph, n2);
    int outDegree1 = d.calculateOutDegree(graph, n1);
    double avDegree = d.calculateAverageDegree(graph, true, false);
    assertEquals(inDegree1, 0);
    assertEquals(inDegree2, 1);
    assertEquals(outDegree1, 1);
    assertEquals(avDegree, 0.5);
}
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)

Example 12 with GraphModel

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

the class DegreeNGTest method testSelfLoopDirectedGraphDegree.

@Test
public void testSelfLoopDirectedGraphDegree() {
    GraphModel graphModel = GraphGenerator.generateSelfLoopDirectedGraph(1);
    DirectedGraph graph = graphModel.getDirectedGraph();
    Node n = graph.getNode("0");
    Degree d = new Degree();
    assertEquals(d.calculateDegree(graph, n), 2);
    assertEquals(d.calculateInDegree(graph, n), 1);
    assertEquals(d.calculateOutDegree(graph, n), 1);
}
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)

Example 13 with GraphModel

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

the class EigenvectorCentralityNGTest method testNullGraphEigenvectorCentrality.

@Test
public void testNullGraphEigenvectorCentrality() {
    GraphModel graphModel = GraphGenerator.generateNullUndirectedGraph(5);
    UndirectedGraph graph = graphModel.getUndirectedGraph();
    EigenvectorCentrality ec = new EigenvectorCentrality();
    ec.setDirected(false);
    double[] centralities = new double[5];
    HashMap<Integer, Node> indicies = new HashMap();
    HashMap<Node, Integer> invIndicies = new HashMap();
    ec.fillIndiciesMaps(graph, centralities, indicies, invIndicies);
    ec.calculateEigenvectorCentrality(graph, centralities, indicies, invIndicies, false, 100);
    Node n2 = graph.getNode("1");
    int index = invIndicies.get(n2);
    double ec2 = centralities[index];
    assertEquals(ec2, 0.0);
}
Also used : HashMap(java.util.HashMap) GraphModel(org.gephi.graph.api.GraphModel) UndirectedGraph(org.gephi.graph.api.UndirectedGraph) Node(org.gephi.graph.api.Node) Test(org.testng.annotations.Test)

Example 14 with GraphModel

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

the class EigenvectorCentralityNGTest method testTwoConnectedNodesEigenvectorCentrality.

@Test
public void testTwoConnectedNodesEigenvectorCentrality() {
    GraphModel graphModel = GraphGenerator.generateCompleteUndirectedGraph(2);
    UndirectedGraph graph = graphModel.getUndirectedGraph();
    EigenvectorCentrality ec = new EigenvectorCentrality();
    double[] centralities = new double[2];
    HashMap<Integer, Node> indicies = new HashMap();
    HashMap<Node, Integer> invIndicies = new HashMap();
    ec.fillIndiciesMaps(graph, centralities, indicies, invIndicies);
    ec.calculateEigenvectorCentrality(graph, centralities, indicies, invIndicies, false, 100);
    Node n1 = graph.getNode("0");
    int index = invIndicies.get(n1);
    double ec1 = centralities[index];
    assertEquals(ec1, 1.0);
}
Also used : HashMap(java.util.HashMap) GraphModel(org.gephi.graph.api.GraphModel) UndirectedGraph(org.gephi.graph.api.UndirectedGraph) Node(org.gephi.graph.api.Node) Test(org.testng.annotations.Test)

Example 15 with GraphModel

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

the class EigenvectorCentralityNGTest method testOneNodeEigenvectorCentrality.

@Test
public void testOneNodeEigenvectorCentrality() {
    GraphModel graphModel = GraphGenerator.generateNullUndirectedGraph(1);
    UndirectedGraph graph = graphModel.getUndirectedGraph();
    EigenvectorCentrality ec = new EigenvectorCentrality();
    double[] centralities = new double[1];
    HashMap<Integer, Node> indicies = new HashMap();
    HashMap<Node, Integer> invIndicies = new HashMap();
    ec.fillIndiciesMaps(graph, centralities, indicies, invIndicies);
    ec.calculateEigenvectorCentrality(graph, centralities, indicies, invIndicies, false, 100);
    Node n1 = graph.getNode("0");
    int index = invIndicies.get(n1);
    double ec1 = centralities[index];
    assertEquals(ec1, 0.0);
}
Also used : HashMap(java.util.HashMap) GraphModel(org.gephi.graph.api.GraphModel) UndirectedGraph(org.gephi.graph.api.UndirectedGraph) Node(org.gephi.graph.api.Node) Test(org.testng.annotations.Test)

Aggregations

GraphModel (org.gephi.graph.api.GraphModel)235 Node (org.gephi.graph.api.Node)169 Test (org.testng.annotations.Test)168 UndirectedGraph (org.gephi.graph.api.UndirectedGraph)115 GraphController (org.gephi.graph.api.GraphController)105 DirectedGraph (org.gephi.graph.api.DirectedGraph)92 Edge (org.gephi.graph.api.Edge)80 Graph (org.gephi.graph.api.Graph)57 HashMap (java.util.HashMap)52 Column (org.gephi.graph.api.Column)16 LinkedList (java.util.LinkedList)12 ArrayList (java.util.ArrayList)11 FilterBuilder (org.gephi.filters.spi.FilterBuilder)6 GraphView (org.gephi.graph.api.GraphView)6 XMLStreamException (javax.xml.stream.XMLStreamException)5 IOException (java.io.IOException)4 AppearanceController (org.gephi.appearance.api.AppearanceController)4 AppearanceModel (org.gephi.appearance.api.AppearanceModel)4 TimeFormat (org.gephi.graph.api.TimeFormat)4 Element (org.gephi.graph.api.Element)3