public VerticesFromEdgesIterable(final Vertex vertex, final Direction direction, final String... labels) { this.direction = direction; this.vertex = vertex; this.iterable = vertex.getEdges(direction, labels); }
public int outDegree(final Vertex vertex) { final Iterable<Edge> itty = vertex.getEdges(Direction.OUT); if (itty instanceof Collection) { return ((Collection) itty).size(); } else { int count = 0; for (final Edge edge : itty) { count++; } return count; } }
@Override public Iterator<Edge> getNeighborsOfVertex(Vertex v) { return v.getEdges(Direction.BOTH, SIMILAR).iterator(); }
public int inDegree(final Vertex vertex) { final Iterable<Edge> itty = vertex.getEdges(Direction.IN); if (itty instanceof Collection) { return ((Collection) itty).size(); } else { int count = 0; for (final Edge edge : itty) { count++; } return count; } }
public Collection<Edge> getInEdges(final Vertex vertex) { final Iterable<Edge> itty = vertex.getEdges(Direction.IN); if (itty instanceof Collection) { return (Collection<Edge>) itty; } else { final List<Edge> edges = new ArrayList<Edge>(); for (final Edge edge : itty) { edges.add(edge); } return edges; } }
public Collection<Edge> getOutEdges(final Vertex vertex) { final Iterable<Edge> itty = vertex.getEdges(Direction.OUT); if (itty instanceof Collection) { return (Collection<Edge>) itty; } else { final List<Edge> edges = new ArrayList<Edge>(); for (final Edge edge : itty) { edges.add(edge); } return edges; } }
Set<Object> edges = new HashSet(); for(Vertex v : orientGraph.getVertices()) { for( Edge e : v.getEdges( Direction.BOTH ) ) edges.add( e.getIdentity() ); } return edges.size();
public Edge findEdge(final Vertex outVertex, final Vertex inVertex) { for (final Edge edge : outVertex.getEdges(Direction.OUT)) { if (edge.getVertex(Direction.IN).equals(inVertex)) { return edge; } } return null; }
@Override public Iterable<GraphEdge<Vertex, Edge>> incomingEdgesOf(Vertex vertex) { return convertEdges(vertex.getEdges(Direction.IN)); } }
public Collection<Vertex> getNeighbors(final Vertex vertex) { final Set<Vertex> vertices = new HashSet<Vertex>(); for (final Edge e : vertex.getEdges(Direction.OUT)) { vertices.add(e.getVertex(Direction.IN)); } for (final Edge e : vertex.getEdges(Direction.IN)) { vertices.add(e.getVertex(Direction.OUT)); } return vertices; }
public Collection<Vertex> getSuccessors(final Vertex vertex) { final Set<Vertex> vertices = new HashSet<Vertex>(); for (final Edge edge : vertex.getEdges(Direction.OUT)) { vertices.add(edge.getVertex(Direction.IN)); } return vertices; }
public boolean isPredecessor(final Vertex outVertex, final Vertex inVertex) { for (final Edge edge : outVertex.getEdges(Direction.IN)) { if (edge.getVertex(Direction.OUT).equals(inVertex)) return true; } return false; }
public Collection<Edge> findEdgeSet(final Vertex outVertex, final Vertex inVertex) { final Set<Edge> edges = new HashSet<Edge>(); for (final Edge edge : outVertex.getEdges(Direction.OUT)) { if (edge.getVertex(Direction.IN).equals(inVertex)) { edges.add(edge); } } return edges; }
public boolean isNeighbor(final Vertex outVertex, final Vertex inVertex) { for (final Edge edge : outVertex.getEdges(Direction.OUT)) { if (edge.getVertex(Direction.IN).equals(inVertex)) return true; } for (final Edge edge : outVertex.getEdges(Direction.IN)) { if (edge.getVertex(Direction.OUT).equals(inVertex)) return true; } return false; }
@Override public Iterable<GraphEdge<Vertex, Edge>> outgoingEdgesOf(Vertex vertex) { return convertEdges(vertex.getEdges(Direction.OUT)); }
protected Edge processNextStart() { while (true) { if (this.nextEnds.hasNext()) { return this.nextEnds.next(); } else { this.nextEnds = this.doBranchFactor ? this.starts.next().query().direction(this.direction).labels(this.labels).limit(this.branchFactor).edges().iterator() : this.starts.next().getEdges(this.direction, this.labels).iterator(); } } }
private void migrateContainer(Vertex nodeContainer) { Iterator<Edge> it = nodeContainer.getEdges(OUT, "HAS_LANGUAGE").iterator(); if (!it.hasNext()) { // We skip containers which have no language set. Those need to be cleaned using the consistency check. return; } Edge languageEdge = it.next(); String languageTag = languageEdge .getVertex(IN).getProperty("languageTag"); nodeContainer.setProperty("languageTag", languageTag); languageEdge.remove(); }
private void removeEdges(final Direction direction, final String label, final Vertex element, final Vertex otherVertex, final FramedGraph framedGraph) { for (final Edge edge : element.getEdges(direction, label)) { if (null == otherVertex || edge.getVertex(direction.opposite()).equals(otherVertex)) { framedGraph.removeEdge(edge); } } } }
public static void assertGraphOfTheGods(TitanGraph gotg) { assertEquals(12,Iterables.size(gotg.getVertices())); assertEquals(3,Iterables.size(gotg.getVertices("label","god"))); Vertex h = Iterables.getOnlyElement(gotg.getVertices("name","hercules")); assertEquals(30,h.getProperty("age")); assertEquals("demigod",((TitanVertex)h).getLabel()); assertEquals(5,Iterables.size(h.getEdges(Direction.BOTH))); gotg.commit(); }