Examples of GraphEdge

Examples of org.jitterbit.ui.graph.edge.GraphEdge

544
545
546
547
548
549
550
551
552
553
554
                }
            }
        }
       
        private GraphEdge getEdgeForRemovedRoute(Route route, OperationWrapperNode from, AbstractGraphNode to) {
            GraphEdge edge = null;
            if (route.getSourceActivity() != null) {
                edge = getEdgeForRemovedScriptSourceRoute(route, from, to);
            } else {
                edge = getEdgeForRemovedOperationActivityRoute(route, from, to);
            }
View Full Code Here

Examples of org.jitterbit.ui.graph.edge.GraphEdge

950
951
952
953
954
955
956
957
958
959
            updateCanvas();
        }

        @Override
        public void nodesConnected(NodesConnectedEvent evt) {
            GraphEdge edge = evt.getNewEdge();
            createUiForEdge(edge);
            layout.nodesConnected(evt);
            updateCanvas();
        }
View Full Code Here

Examples of org.jitterbit.ui.graph.edge.GraphEdge

958
959
960
961
962
963
964
965
966
            updateCanvas();
        }

        @Override
        public void nodesDisconnected(NodesDisconnectedEvent evt) {
            GraphEdge edge = evt.getRemovedEdge();
            edgeUis.remove(edge);
            updateCanvas();
        }
View Full Code Here

Examples of org.jitterbit.ui.graph.edge.GraphEdge

1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
            @Override
            public void dragOver(DropTargetDragEvent dtde) {
                Point p = adjustPointForZoom(dtde.getLocation());
                Object node = getNodeAt(p);
                GraphEdge edge = getEdgeAt(p);
                if (node == null && edge == null) {
                    reset();
                    checkCanvasDrop(dtde);
                } else if (node != null && edge != null) {
                    if (isNodeAboveEdge(node, edge)) {
View Full Code Here

Examples of org.jitterbit.ui.graph.edge.GraphEdge

120
121
122
123
124
125
126
127
128
129
130
        removeMemberNodeEdgesFromRemovedEdges();
    }
   
    private void removeMemberNodeEdgesFromRemovedEdges() {
        for (Iterator<? extends GraphEdge> it = removedEdges.iterator(); it.hasNext(); ) {
            GraphEdge edge = it.next();
            if (belongsToRemovedGroup(edge.to()) || belongsToRemovedGroup(edge.from())) {
                it.remove();
            }
        }
    }
View Full Code Here

Examples of org.jitterbit.ui.graph.edge.GraphEdge

281
282
283
284
285
286
287
288
                orderSize = newOrderSize;
            }
        }
       
        private boolean canBeAdded(Object node) {
            GraphEdge in = findIncomingEdge(node);
            return in == null || order.contains(in.from());
        }
View Full Code Here

Examples of org.jitterbit.ui.graph.edge.GraphEdge

39
40
41
42
43
44
45
46
        removeOrphans();
        eventSupport.fireModelChanged();
    }
   
    public void addEdge(Object from, Object to) {
        GraphEdge edge = createEdge(from, to);
        addEdge(edge);
    }
View Full Code Here

Examples of org.locationtech.geogig.storage.GraphDatabase.GraphEdge

85
86
87
88
89
90
91
92
93
94
95
96
        Iterator<GraphEdge> outgoing = node.getEdges(Direction.OUT);
        if (outgoing.hasNext()) {
            boolean node_sparse = node.isSparse();
            boolean combined_sparse = false;
            while (outgoing.hasNext()) {
                GraphEdge parent = outgoing.next();
                GraphNode parentNode = parent.getToNode();
                combined_sparse = combined_sparse
                        || isSparsePath(parentNode, end, sparse || node_sparse);
            }
            return combined_sparse;
        }
View Full Code Here

Examples of org.locationtech.geogig.storage.GraphDatabase.GraphEdge

158
159
160
161
162
163
164
165
166
167
168
169
                stopAncestryPath(commit, theirQueue, theirSet);
                return true;
            }
            Iterator<GraphEdge> edges = commit.getEdges(Direction.OUT);
            while (edges.hasNext()) {
                GraphEdge parentEdge = edges.next();
                GraphNode parent = parentEdge.getToNode();
                myQueue.add(parent);
            }
        }
        return false;
View Full Code Here

Examples of org.locationtech.geogig.storage.GraphDatabase.GraphEdge

186
187
188
189
190
191
192
193
194
195
196
197
        Set<GraphNode> processed = new HashSet<GraphNode>();
        while (!ancestorQueue.isEmpty()) {
            GraphNode ancestor = ancestorQueue.poll();
            Iterator<GraphEdge> edges = ancestor.getEdges(Direction.OUT);
            while (edges.hasNext()) {
                GraphEdge relationship = edges.next();
                GraphNode parentNode = relationship.getToNode();
                if (theirSet.contains(parentNode)) {
                    if (!processed.contains(parentNode)) {
                        ancestorQueue.add(parentNode);
                        processed.add(parentNode);
                    }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.