Examples of Edge

Examples of com.ojn.gexf4j.core.Edge

197
198
199
200
201
202
203
204
205
    checkArgument(id != null, "ID cannot be null.");
    checkArgument(!id.trim().isEmpty(), "ID cannot be empty or blank.");
    checkArgument(target != null, "Target cannot be null.");
    checkArgument(!hasEdgeTo(target.getId()), "Edge already exists.");
   
    Edge rv = new EdgeImpl(id, this, target);
    edges.add(rv);
    return rv;
  }
View Full Code Here

Examples of com.puppetlabs.graph.elements.Edge

838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
        // CASE 1
        // A --> [...] --> B
        // A imports from resolved B
        if(count == 2 && resolved == 1 && implied == 1) {
          Edge e1 = new Edge("", STYLE_EDGE__IMPORT, a.getVertex(), edges.get(1).getVertex());
          Edge e2 = new Edge(getVersionLabel(edges.get(0)), STYLE_EDGE__RESOLVED_DEP, //
          edges.get(1).getVertex(), b.getVertex());
          g.addEdge(e1, e2);
          addTooltip(tooltipString, e1, e2);
          addStyleClasses(styleClasses, e1, e2);
          addEdgeHref(a, b, e1, e2);
        }
        else if(count == 1 && implied == 1) {
          // CASE 5
          // A --> [...]
          if(edges.get(0).to == null) {
            Edge e1 = new Edge("unresolved", STYLE_EDGE__UIMPORT, a.getVertex(), edges.get(0).getVertex());
            g.addEdge(e1);
            addTooltip(tooltipString, e1);
            addStyleClasses(styleClasses, e1);
            addEdgeHref(a, b, e1);
          }
          // CASE 8 (reference to pptp - do not draw imports -> pptp part)
          // A -->[...]
          else if(edges.get(0).to == pptpNode) {
            Edge e1 = new Edge("puppet", STYLE_EDGE__IMPORT, a.getVertex(), edges.get(0).getVertex());
            g.addEdge(e1);
            // default tooltip == label
            addStyleClasses(styleClasses, e1);
            addEdgeHref(a, b, e1);

          }
          // CASE 2 (and CASE 0 - self reference)
          // A -->[...] ~~> B
          else {
            if(edges.get(0).from != edges.get(0).to) { // skip self references
              Edge e1 = new Edge("", STYLE_EDGE__IMPORT, a.getVertex(), edges.get(0).getVertex());
              Edge e2 = new Edge(
                "implicit", STYLE_EDGE__IMPLIED_DEP, edges.get(0).getVertex(),
                edges.get(0).to.getVertex());
              g.addEdge(e1, e2);
              addTooltip(tooltipString, e1, e2);
              addStyleClasses(styleClasses, e1, e2);
              addEdgeHref(a, b, e1, e2);
            }
          }
        }
        // CASE 3
        // A --> [...] ~~>(not in range) B
        else if(count == 2 && implied == 1 && unresolved == 1) {
          Edge e1 = new Edge("", STYLE_EDGE__IMPORT, a.getVertex(), edges.get(1).getVertex());
          String label = "implicit\\nunresolved\\n" + getVersionLabel(edges.get(0));
          Edge e2 = new Edge(label, STYLE_EDGE__UNRESOLVED_IMPLIED_DEP, //
          edges.get(1).getVertex(), edges.get(1).to.getVertex());
          g.addEdge(e1, e2);
          addTooltip(tooltipString, e1, e2);
          addStyleClasses(styleClasses, e1, e2);
          addEdgeHref(a, b, e1, e2);
        }

        else if(count == 1 && unresolved == 1) {
          // CASE 7
          // A ~~> B where B is not in range
          if(edges.get(0).to.exists()) {
            String label = "unresolved\\n" + getVersionLabel(edges.get(0));
            Edge e1 = new Edge(label, STYLE_EDGE__UNRESOLVED_IMPLIED_DEP, //
            a.getVertex(), b.getVertex());
            g.addEdge(e1);
            addTooltip(tooltipString, e1);
            addStyleClasses(styleClasses, e1);
            addEdgeHref(a, b, e1);
          }
          // CASE 4
          // A --> B where B does not exist
          else {
            String label = "unresolved\\n" + getVersionLabel(edges.get(0));
            Edge e1 = new Edge(label, STYLE_EDGE__UNRESOLVED_DEP, //
            a.getVertex(), b.getVertex());
            g.addEdge(e1);
            addTooltip(tooltipString, e1);
            addStyleClasses(styleClasses, e1);
            addEdgeHref(a, b, e1);
          }
        }
        // CASE 6
        // A --> B
        // (nothing is imported from B)
        else if(count == 1 && resolved == 1) {
          Edge e1 = new Edge(getVersionLabel(edges.get(0)), STYLE_EDGE__RESOLVED_DEP, //
          a.getVertex(), b.getVertex());
          g.addEdge(e1);
          addTooltip(tooltipString, e1);
          addStyleClasses(styleClasses, e1);
          addEdgeHref(a, b, e1);
View Full Code Here

Examples of com.sk89q.worldedit.regions.polyhedron.Edge

186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
            // Remove the triangle from the mesh
            it.remove();

            // ...and remember its edges
            for (int i = 0; i < 3; ++i) {
                final Edge edge = triangle.getEdge(i);
                if (borderEdges.remove(edge)) {
                    continue;
                }

                borderEdges.add(edge);
            }
        }

        // Add triangles between the remembered edges and the new vertex.
        for (Edge edge : borderEdges) {
            triangles.add(edge.createTriangle(vertex));
        }

        if (!vertexBacklog.isEmpty()) {
            // Remove the new vertex
            vertices.remove(vertex);
View Full Code Here

Examples of com.tinkerpop.blueprints.Edge

306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
    public void testEdgesById() throws Exception {
        String processInstance = PROCESS_ENTITY_NAME + "/2014-01-01T01:00Z";
        Vertex vertex = service.getGraph().getVertices(
                RelationshipProperty.NAME.getName(), processInstance).iterator().next();

        Edge edge = vertex.getEdges(Direction.OUT,
                RelationshipLabel.PROCESS_CLUSTER_EDGE.getName()).iterator().next();
        Vertex toVertex = edge.getVertex(Direction.IN);

        LineageMetadataResource resource = new LineageMetadataResource();
        Response response = resource.getEdge(String.valueOf(edge.getId()));
        Assert.assertEquals(response.getStatus(), Response.Status.OK.getStatusCode());

        Map results = (Map) JSONValue.parse(response.getEntity().toString());
        Map vertexProperties = (Map) results.get(LineageMetadataResource.RESULTS);

        Assert.assertEquals(vertexProperties.get("_id").toString(), edge.getId().toString());
        Assert.assertEquals(vertexProperties.get("_outV"), vertex.getId());
        Assert.assertEquals(vertexProperties.get("_inV"), toVertex.getId());
    }
View Full Code Here

Examples of com.tinkerpop.blueprints.pgm.Edge

246
247
248
249
250
251
252
253
254
255
256
      oldVertices.put(inVertex, e);
    }
    for(Object v : values) {
      Vertex valueVertex = getVertexFor(v, CascadeType.REFRESH, objectsBeingAccessed);
      if(oldVertices.containsKey(valueVertex)) {
        Edge oldEdge = oldVertices.remove(valueVertex);
        database.removeEdge(oldEdge);
        if(toCascade.contains(CascadeType.REMOVE)) {
          deleteOutEdgeVertex(objectVertex, valueVertex, v, objectsBeingAccessed);
        }
      }
View Full Code Here

Examples of com.tinkerpop.gremlin.structure.Edge

377
378
379
380
381
382
383
384
385
386
387
                        Optional.ofNullable(keyValues) : ElementHelper.remove(T.id, keysVals);

                if (id.isPresent()) {
                    final Traversal<Edge, Edge> traversal = baseGraph.E().has(edgeIdKey, id.get());
                    if (traversal.hasNext()) {
                        final Edge e = traversal.next();
                        // let the user decide how to handle conflict
                        kvs.ifPresent(keyvals -> existingEdgeStrategy.accept(e, keyvals));
                        currentEdgeCached = e;
                    } else
                        currentEdgeCached = kvs.isPresent() ? ov.addEdge(label, iv, kvs.get()) : ov.addEdge(label, iv);
View Full Code Here

Examples of com.trolltech.qt.gui.QTextLine.Edge

166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
      return;
   
    this.setVisible(true);
    if(!selectWays)
    {
      Edge e = ((WayItem) v).getPreviouslySelectedEdge();
      if (e != null) {
        if(previousEdge != null) {
          // check integrity condition
          if(!previousEdge.getToNode().equals(e.getFromNode()))
          {
            errorLabel.setVisible(true);
            return;
          } else {
            errorLabel.setVisible(false);
          }
        }
        previousEdge = e;
        selectedEdges.add(e);
        edgesWidget.addItem(e.getParentWay().getDescription() + ":" + e.getInternalID());
      }
    } else {
      Way w = ((WayItem)v).getAssociatedElement();
      List<Edge> forwardEdges = w.getForwardEdges();
      for(Edge e : forwardEdges) {
        if(previousEdge != null) {
          if(!previousEdge.getToNode().equals(e.getFromNode()))
          {
            errorLabel.setVisible(true);
            return;
          } else {
            errorLabel.setVisible(false);
          }
        }
        previousEdge = e;
        selectedEdges.add(e);
        edgesWidget.addItem(e.getParentWay().getDescription() + ":" + e.getInternalID());
      }
    }
  }
View Full Code Here

Examples of com.vividsolutions.jts.geomgraph.Edge

173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
    public boolean equalsCoordinates( Object o ) {
       
        if (!(o instanceof Edge))
            return false;
        Edge e = (Edge) o;

        if (this.getCoordinates().length != e.getCoordinates().length)
            return false;

        for( int i = 0; i < this.getCoordinates().length; i++ ) {
           
            boolean found =false;
            for( int j = 0; j < e.getCoordinates().length; j++ ) {

                if(this.getCoordinate(i).equals2D(e.getCoordinate(j))){
                    found=true;
                    break;
                }
            }
            if(!found){
View Full Code Here

Examples of com.vividsolutions.jts.planargraph.Edge

63
64
65
66
67
68
69
70
71
    Node endNode = getNode(endCoordinate);
    DirectedEdge directedEdge0 = new LineMergeDirectedEdge(startNode, endNode,
        coordinates[1], true);
    DirectedEdge directedEdge1 = new LineMergeDirectedEdge(endNode, startNode,
        coordinates[coordinates.length - 2], false);
    Edge edge = new LineMergeEdge(lineString);
    edge.setDirectedEdges(directedEdge0, directedEdge1);
    add(edge);
  }
View Full Code Here

Examples of de.hwrberlin.it11.tsp.model.Edge

205
206
207
208
209
210
211
212
213
214
215
216
            // Jede Ameise platziert Pheromone auf den Kanten, die sie besucht hat
            for (Ant ant : antList) {
              for (int j = 0; j < ant.getVisitedNodes().size() - 1; j++) {
                Node node = ant.getVisitedNodes().get(j);
                Node otherNode = ant.getVisitedNodes().get(j + 1);
                Edge edge = node.getEdge(otherNode);
                edge.setPheromone(edge.getPheromone() + _project.getParameter().getPheromonUpdateParameter()
                    / ant.getTravelledDistance());
              }
            }

            // Berechnung der Durchschnittswerte der Tourl�ngen
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.