@Override public List<Ref> getContent() { return new ArrayList<Ref>(getEdges()); } };
@Override public List<Ref> getContent() { return new ArrayList<Ref>(getEdges()); } };
@Override public List<Ref> getContent() { return new ArrayList<Ref>(getEdges()); } };
@Override public final Map<VertexRef, Set<EdgeRef>> getEdgeIdsForVertices(VertexRef... vertices) { List<Edge> edges = getEdges(); Map<VertexRef,Set<EdgeRef>> retval = new HashMap<VertexRef,Set<EdgeRef>>(); for (VertexRef vertex : vertices) { if (vertex == null) continue; Set<EdgeRef> edgeSet = new HashSet<EdgeRef>(); for (Edge edge : edges) { // If the vertex is connected to the edge then add it if (new RefComparator().compare(edge.getSource().getVertex(), vertex) == 0 || new RefComparator().compare(edge.getTarget().getVertex(), vertex) == 0) { edgeSet.add(edge); } } retval.put(vertex, edgeSet); } return retval; }
@Override public final EdgeRef[] getEdgeIdsForVertex(VertexRef vertex) { if (vertex == null) return new EdgeRef[0]; List<EdgeRef> retval = new ArrayList<EdgeRef>(); for (Edge edge : getEdges()) { // If the vertex is connected to the edge then add it if (new RefComparator().compare(edge.getSource().getVertex(), vertex) == 0 || new RefComparator().compare(edge.getTarget().getVertex(), vertex) == 0) { retval.add(edge); } } return retval.toArray(new EdgeRef[0]); }
@Override public final EdgeRef[] getEdgeIdsForVertex(VertexRef vertex) { if (vertex == null) return new EdgeRef[0]; List<EdgeRef> retval = new ArrayList<EdgeRef>(); for (Edge edge : getEdges()) { // If the vertex is connected to the edge then add it if (new RefComparator().compare(edge.getSource().getVertex(), vertex) == 0 || new RefComparator().compare(edge.getTarget().getVertex(), vertex) == 0) { retval.add(edge); } } return retval.toArray(new EdgeRef[0]); }
@Override public final EdgeRef[] getEdgeIdsForVertex(VertexRef vertex) { if (vertex == null) return new EdgeRef[0]; List<EdgeRef> retval = new ArrayList<EdgeRef>(); for (Edge edge : getEdges()) { // If the vertex is connected to the edge then add it if (new RefComparator().compare(edge.getSource().getVertex(), vertex) == 0 || new RefComparator().compare(edge.getTarget().getVertex(), vertex) == 0) { retval.add(edge); } } return retval.toArray(new EdgeRef[0]); }
@Override public final Map<VertexRef, Set<EdgeRef>> getEdgeIdsForVertices(VertexRef... vertices) { List<Edge> edges = getEdges(); Map<VertexRef,Set<EdgeRef>> retval = new HashMap<VertexRef,Set<EdgeRef>>(); for (VertexRef vertex : vertices) { if (vertex == null) continue; Set<EdgeRef> edgeSet = new HashSet<EdgeRef>(); for (Edge edge : edges) { // If the vertex is connected to the edge then add it if (new RefComparator().compare(edge.getSource().getVertex(), vertex) == 0 || new RefComparator().compare(edge.getTarget().getVertex(), vertex) == 0) { edgeSet.add(edge); } } retval.put(vertex, edgeSet); } return retval; }
@Override public final Map<VertexRef, Set<EdgeRef>> getEdgeIdsForVertices(VertexRef... vertices) { List<Edge> edges = getEdges(); Map<VertexRef,Set<EdgeRef>> retval = new HashMap<VertexRef,Set<EdgeRef>>(); for (VertexRef vertex : vertices) { if (vertex == null) continue; Set<EdgeRef> edgeSet = new HashSet<EdgeRef>(); for (Edge edge : edges) { // If the vertex is connected to the edge then add it if (new RefComparator().compare(edge.getSource().getVertex(), vertex) == 0 || new RefComparator().compare(edge.getTarget().getVertex(), vertex) == 0) { edgeSet.add(edge); } } retval.put(vertex, edgeSet); } return retval; }