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

org.gephi.graph.api.Graph.readUnlock()
Releases the read lock on the graph. Must be called from the same thread that locked the graph.
Use readUnlockAll() if you ignore the number of times the read lock has been acquired.

                    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);
                            }
                        } else {

View Full Code Here

                    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
                        if (source == null) {
                            source = gec.createNode(null, sourceId);

View Full Code Here

                    }
                }


                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
                        if (target == null) {
                            target = gec.createNode(null, targetId);

View Full Code Here

                graph.readUnlockAll();
                return;
            }
        }


        graph.readUnlock();


        matrix = matrix.transpose();
        matrix = run(matrix, maxResidual, gammaExp, loopGain, zeroMax);


        if (cancelled) {

View Full Code Here


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


    public int getEdgesCount() {
        Graph graph = getGraph();

View Full Code Here


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


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

View Full Code Here

                node.getNodeData().setX(px + (x - px) * (speed / 10000f));
                node.getNodeData().setY(py + (y - py) * (speed / 10000f));
            }
        }


        graph.readUnlock();
    }


    @Override
    public void endAlgo() {
        executing = false;

View Full Code Here

                node.getNodeData().setX(px + (x - px) * (speed / 10000f));
                node.getNodeData().setY(py + (y - py) * (speed / 10000f));
            }
        }


        graph.readUnlock();
    }


    @Override
    public void endAlgo() {
        executing = false;

View Full Code Here

            } else if (id != null && !id.isEmpty()) {
                data.put(id, n);
            }
            
        }
        graph.readUnlock();
    }
    
    @Override
    public void unselect() {
        //Clean data

View Full Code Here

                    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);
                            }
                        } else {

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.