Examples of org.gephi.graph.api.Graph

org.gephi.graph.api.Graph
Main interface for accessing the graph structure and develop algorithms.
A graph object belongs to a graph model, which really contains the data. Graph objects are therefore only accessors, with all convinient methods to read and modify the structure. Hence, multiple Graph objects can exists.
Get current graph
```
 GraphController graphController = Lookup.getDefault().lookup(GraphController.class); GraphModel model = graphController.getModel(); Graph graph = model.getGraph(); 
```
Note: This shows how to get the complete graph, for getting only the currently visualized graph, call model.getGraphVisible() instead.
Graph Locking
Graph structure possess a locking mechanism that avoids multiple threads to modify the structure concurrently. However, several readers are allowed.
There is two different way to perform read locking:
- Manually by calling readLock() and readUnlock()
- Structure is automatically locked when you read the various NodeIterable and EdgeIterable
Be always sure you don't leave the structure blocked. use readUnlockAll() to release all the locks.
Note: Write locking is automatically done when modifying th graph (add, remove, ...). @author Mathieu Bastian

    }
    
   @Test
    public void testCompleteGraphClusteringCoefficient() {
        GraphModel graphModel=GraphGenerator.generateCompleteUndirectedGraph(5);
        Graph hgraph = graphModel.getGraph();


        ClusteringCoefficient cc = new ClusteringCoefficient();
        ArrayWrapper[] network = new ArrayWrapper[5];
        int[] triangles = new int[5];
        double[] nodeClustering = new double[5];

View Full Code Here

    }
   
   @Test
    public void testStarGraphClusteringCoefficient() {
        GraphModel graphModel=GraphGenerator.generateStarUndirectedGraph(5);
        Graph hgraph = graphModel.getGraph();


        ClusteringCoefficient cc = new ClusteringCoefficient();
        ArrayWrapper[] network = new ArrayWrapper[6];
        int[] triangles = new int[6];
        double[] nodeClustering = new double[6];

View Full Code Here

        undirectedGraph.addEdge(edge45);
        undirectedGraph.addEdge(edge56);
        undirectedGraph.addEdge(edge67);
        undirectedGraph.addEdge(edge72);
        
        Graph hgraph = graphModel.getGraph();
        ClusteringCoefficient cc = new ClusteringCoefficient();


        ArrayWrapper[] network = new ArrayWrapper[7];
        int[] triangles = new int[7];
        double[] nodeClustering = new double[7];

View Full Code Here

        undirectedGraph.addEdge(edge51);
        undirectedGraph.addEdge(edge16);
        undirectedGraph.addEdge(edge67);
        undirectedGraph.addEdge(edge71);
        
        Graph hgraph = graphModel.getGraph();
        ClusteringCoefficient cc = new ClusteringCoefficient();


        ArrayWrapper[] network = new ArrayWrapper[7];
        int[] triangles = new int[7];
        double[] nodeClustering = new double[7];

View Full Code Here

        undirectedGraph.addEdge(edge31);
        undirectedGraph.addEdge(edge14);
        undirectedGraph.addEdge(edge25);
        undirectedGraph.addEdge(edge36);;
        
        Graph hgraph = graphModel.getGraph();
        ClusteringCoefficient cc = new ClusteringCoefficient();


        ArrayWrapper[] network = new ArrayWrapper[6];
        int[] triangles = new int[6];
        double[] nodeClustering = new double[6];

View Full Code Here

    }
   
   @Test
    public void testTriangleGraphClusteringCoefficient() {
        GraphModel graphModel=GraphGenerator.generateCompleteUndirectedGraph(3);
        Graph hgraph = graphModel.getGraph();


        ClusteringCoefficient cc = new ClusteringCoefficient();
        ArrayWrapper[] network = new ArrayWrapper[3];


        int[] triangles = new int[3];

View Full Code Here

    }


    @Test
    public void testOneNodeDensity() {
        GraphModel graphModel = GraphGenerator.generateNullUndirectedGraph(1);
        Graph graph = graphModel.getGraph();
        GraphDensity d = new GraphDensity();
        double density = d.calculateDensity(graph, false);
        assertEquals(density, Double.NaN);
    }

View Full Code Here

    }


    @Test
    public void testTwoConnectedNodesDensity() {
        GraphModel graphModel = GraphGenerator.generateCompleteUndirectedGraph(2);
        Graph graph = graphModel.getGraph();
        GraphDensity d = new GraphDensity();
        double density = d.calculateDensity(graph, false);
        assertEquals(density, 1.0);
    }

View Full Code Here

    }


    @Test
    public void testNullGraphDensity() {
        GraphModel graphModel = GraphGenerator.generateNullUndirectedGraph(5);
        Graph graph = graphModel.getGraph();
        GraphDensity d = new GraphDensity();
        double density = d.calculateDensity(graph, false);
        assertEquals(density, 0.0);
    }

View Full Code Here

    }


    @Test
    public void testCompleteGraphDensity() {
        GraphModel graphModel = GraphGenerator.generateCompleteUndirectedGraph(5);
        Graph graph = graphModel.getGraph();
        GraphDensity d = new GraphDensity();
        double density = d.calculateDensity(graph, false);
        assertEquals(density, 1.0);
    }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of org.gephi.graph.api.Graph

org.gephi.clustering.plugin.mcl.MarkovClustering

org.gephi.datalab.impl.AttributeColumnsControllerImpl

org.gephi.datalab.impl.GraphElementsControllerImpl

org.gephi.desktop.context.ContextPanel$RefreshRunnable

org.gephi.desktop.ranking.ResultListPanel

org.gephi.dynamic.DynamicGraphImpl

org.gephi.dynamic.DynamicGraphImplTest

org.gephi.dynamic.DynamicModelImpl

org.gephi.filters.FilterControllerImpl

org.gephi.filters.FilterModelPersistenceProvider

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.

Examples of org.gephi.graph.api.Graph

Get current graph

Graph Locking

Related Classes of org.gephi.graph.api.Graph