Examples of org.gephi.graph.api.Graph.readLock()

org.gephi.graph.api.Graph.readLock()
Acquires a read lock on the graph. Calling thread will be blocked until all write locks are released. Several threads can read but only once can write.
A read lock can be acquired several times by a thread, but be sure to call readUnlock() the same number of time you called this method, or use readUnlockAll() to release all locks. @see ReentrantReadWriteLock

                if (idColumn != null) {
                    id = reader.get(idColumn);
                    if (id == null || id.isEmpty()) {
                        node = gec.createNode(null);//id null or empty, assign one
                    } else {
                        graph.readLock();
                        node = graph.getNode(id);
                        graph.readUnlock();
                        if (node != null) {//Node with that id already in graph
                            if (assignNewNodeIds) {
                                node = gec.createNode(null);

View Full Code Here


                if (sourceId == null || sourceId.isEmpty() || targetId == null || targetId.isEmpty()) {
                    continue;//No correct source and target ids were provided, ignore row
                }


                graph.readLock();
                source = graph.getNode(sourceId);
                graph.readUnlock();


                if (source == null) {
                    if (createNewNodes) {//Create new nodes when they don't exist already and option is enabled

View Full Code Here

                    } else {
                        continue;//Ignore this edge row, since no new nodes should be created.
                    }
                }


                graph.readLock();
                target = graph.getNode(targetId);
                graph.readUnlock();


                if (target == null) {
                    if (createNewNodes) {//Create new nodes when they don't exist already and option is enabled

View Full Code Here


        HashMap<Integer, Node> nodeMap = new HashMap<Integer, Node>();
        HashMap<Node, Integer> intMap = new HashMap<Node, Integer>();


        Graph graph = graphModel.getGraphVisible();
        graph.readLock();


        //Load matrix
        SparseMatrix matrix = new SparseMatrix();
        int nodeId = 0;
        for (Edge e : graph.getEdges()) {

View Full Code Here

        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

        return nodesCount;
    }


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

View Full Code Here

    }


    @Override
    public void goAlgo() {
        Graph graph = graphModel.getGraphVisible();
        graph.readLock();
        int nodeCount = graph.getNodeCount();
        Node[] nodes = graph.getNodes().toArray();


        if (column != null) {
            Arrays.sort(nodes, new Comparator<Node>() {

View Full Code Here

    }


    @Override
    public void goAlgo() {
        Graph graph = graphModel.getGraphVisible();
        graph.readLock();
        int nodeCount = graph.getNodeCount();
        Node[] nodes = graph.getNodes().toArray();


        int rows = (int) Math.round(Math.sqrt(nodeCount)) + 1;
        int cols = (int) Math.round(Math.sqrt(nodeCount)) + 1;

View Full Code Here

        //Get current visible graph
        GraphController graphController = Lookup.getDefault().lookup(GraphController.class);
        Graph graph = graphController.getModel().getGraphVisible();
        
        //Build the autocomplete data. A simple map from node's label
        graph.readLock();
        data = new HashMap<String, Node>();
        for (Node n : graph.getNodes()) {
            String label = n.getNodeData().getLabel();
            String id = n.getNodeData().getId();
            if (label != null) {

View Full Code Here

                if (idColumn != null) {
                    id = reader.get(idColumn);
                    if (id == null || id.isEmpty()) {
                        node = gec.createNode(null);//id null or empty, assign one
                    } else {
                        graph.readLock();
                        node = graph.getNode(id);
                        graph.readUnlock();
                        if (node != null) {//Node with that id already in graph
                            if (assignNewNodeIds) {
                                node = gec.createNode(null);

View Full Code Here

0 1

TOP

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.