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

        getGraph().addNode(newNode);
        return newNode;
    }


    public Node createNode(String label, String id) {
        Graph graph = getGraph();
        if (graph.getNode(id) == null) {
            Node newNode = buildNode(label, id);
            graph.addNode(newNode);
            return newNode;
        } else {
            return null;
        }
    }

View Full Code Here

    public void deleteNode(Node node) {
        removeNode(node, getGraph());
    }


    public void deleteNodes(Node[] nodes) {
        Graph graph = getGraph();
        for (Node node : nodes) {
            removeNode(node, graph);
        }
    }

View Full Code Here

    public void deleteEdge(Edge edge) {
        removeEdge(edge, getGraph());
    }


    public void deleteEdges(Edge[] edges) {
        Graph graph = getGraph();
        for (Edge edge : edges) {
            removeEdge(edge, graph);
        }
    }

View Full Code Here

    public Edge[] getNodeEdges(Node node) {
        return getGraph().getEdges(node).toArray();
    }


    public int getNodesCount() {
        Graph graph = getGraph();
        graph.readLock();
        int nodesCount = graph.getNodeCount();
        graph.readUnlock();
        return nodesCount;
    }

View Full Code Here

        graph.readUnlock();
        return nodesCount;
    }


    public int getEdgesCount() {
        Graph graph = getGraph();
        graph.readLock();
        int edgesCount = graph.getEdgeCount();
        graph.readUnlock();
        return edgesCount;
    }

View Full Code Here

    public boolean isNodeInGraph(Node node) {
        return getGraph().contains(node);
    }


    public boolean areNodesInGraph(Node[] nodes) {
        Graph graph = getGraph();
        for (Node n : nodes) {
            if (!graph.contains(n)) {
                return false;
            }
        }
        return true;
    }

View Full Code Here

    public boolean isEdgeInGraph(Edge edge) {
        return getGraph().contains(edge);
    }


    public boolean areEdgesInGraph(Edge[] edges) {
        Graph graph = getGraph();
        for (Edge e : edges) {
            if (!graph.contains(e)) {
                return false;
            }
        }
        return true;
    }

View Full Code Here

        AttributeModel destAttributeModel = attributeController.getModel(workspace);
        destAttributeModel.mergeModel(sourceAttributeModel);


        GraphModel sourceModel = graphController.getModel(currentWorkspace);
        GraphModel destModel = graphController.getModel(workspace);
        Graph destGraph = destModel.getHierarchicalGraphVisible();
        Graph sourceGraph = sourceModel.getHierarchicalGraphVisible();


        destModel.pushNodes(sourceGraph, nodes);
    }

View Full Code Here

        }
    }


    public NodeRanking getDegreeRanking() {
        GraphModel model = Lookup.getDefault().lookup(GraphController.class).getModel();
        Graph graph = model.getGraphVisible();
        NodeRanking degreeRanking = RankingFactory.getNodeDegreeRanking(graph);
        if (degreeRanking.getMinimumValue() != null && degreeRanking.getMaximumValue() != null && !degreeRanking.getMinimumValue().equals(degreeRanking.getMaximumValue())) {
            return degreeRanking;
        }
        return null;

View Full Code Here

        return null;
    }


    public NodeRanking getNodeAttributeRanking(AttributeColumn column) {
        GraphModel model = Lookup.getDefault().lookup(GraphController.class).getModel();
        Graph graph = model.getGraphVisible();
        if (RankingFactory.isNumberColumn(column)) {
            NodeRanking r = RankingFactory.getNodeAttributeRanking(column, graph);
            if (r.getMinimumValue() != null && r.getMaximumValue() != null && !r.getMinimumValue().equals(r.getMaximumValue())) {
                return r;
            }

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