@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]); }
private void updateLayout(Collection<Vertex> displayVertices, Collection<Edge> displayEdges) { m_displayVertices.clear(); m_displayVertices.addAll(displayVertices); m_displayEdges.clear(); m_displayEdges.addAll(displayEdges); for (Iterator<Edge> itr = m_displayEdges.iterator(); itr.hasNext();) { Edge edge = itr.next(); if (new RefComparator().compare(edge.getSource().getVertex(), edge.getTarget().getVertex()) == 0) { LOG.debug("Discarding edge whose source and target are the same: {}", edge); itr.remove(); } else if (m_displayVertices.contains(edge.getSource().getVertex())) { if (m_displayVertices.contains(edge.getTarget().getVertex())) { // This edge is OK, it is attached to two vertices that are in the graph } else { LOG.debug("Discarding edge that is not attached to 2 vertices in the graph: {}", edge); itr.remove(); } } else { LOG.debug("Discarding edge that is not attached to 2 vertices in the graph: {}", edge); itr.remove(); } } LOG.debug("Created a graph with {} vertices and {} edges", m_displayVertices.size(), m_displayEdges.size()); } }
@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; }
private void updateLayout(Collection<Vertex> displayVertices, Collection<Edge> displayEdges) { m_displayVertices.clear(); m_displayVertices.addAll(displayVertices); m_displayEdges.clear(); m_displayEdges.addAll(displayEdges); for (Iterator<Edge> itr = m_displayEdges.iterator(); itr.hasNext();) { Edge edge = itr.next(); if (new RefComparator().compare(edge.getSource().getVertex(), edge.getTarget().getVertex()) == 0) { LOG.debug("Discarding edge whose source and target are the same: {}", edge); itr.remove(); } else if (m_displayVertices.contains(edge.getSource().getVertex())) { if (m_displayVertices.contains(edge.getTarget().getVertex())) { // This edge is OK, it is attached to two vertices that are in the graph } else { LOG.debug("Discarding edge that is not attached to 2 vertices in the graph: {}", edge); itr.remove(); } } else { LOG.debug("Discarding edge that is not attached to 2 vertices in the graph: {}", edge); itr.remove(); } } LOG.debug("Created a graph with {} vertices and {} edges", m_displayVertices.size(), m_displayEdges.size()); } }
@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; }
@Override public List<Vertex> getChildren(VertexRef group, Criteria... criteria) { for (CollapsibleCriteria criterium : getCollapsedCriteria(criteria)) { if (new RefComparator().compare(criterium.getCollapsedRepresentation(), group) == 0) { return getVertices(criterium.getVertices()); } } return Collections.emptyList(); }
@Override public Vertex getVertex(VertexRef reference, Criteria... criteria) { for (CollapsibleCriteria criterium : getCollapsedCriteria(criteria)) { Vertex collapsed = criterium.getCollapsedRepresentation(); if (new RefComparator().compare(collapsed, reference) == 0) { return collapsed; } } return m_delegate.getVertex(reference, criteria); }
@Override public List<Vertex> getChildren(VertexRef group, Criteria... criteria) { for (CollapsibleCriteria criterium : getCollapsedCriteria(criteria)) { if (new RefComparator().compare(criterium.getCollapsedRepresentation(), group) == 0) { return getVertices(criterium.getVertices()); } } return Collections.emptyList(); }
@Override public List<Vertex> getChildren(VertexRef group, Criteria... criteria) { for (CollapsibleCriteria criterium : getCollapsedCriteria(criteria)) { if (new RefComparator().compare(criterium.getCollapsedRepresentation(), group) == 0) { return getVertices(criterium.getVertices()); } } return Collections.emptyList(); }
@Override public boolean containsVertexId(VertexRef id, Criteria... criteria) { for (CollapsibleCriteria criterium : getCollapsedCriteria(criteria)) { Vertex collapsed = criterium.getCollapsedRepresentation(); if (new RefComparator().compare(collapsed, id) == 0) { return true; } } return m_delegate.containsVertexId(id, criteria); }
@Override public boolean containsVertexId(VertexRef id, Criteria... criteria) { for (CollapsibleCriteria criterium : getCollapsedCriteria(criteria)) { Vertex collapsed = criterium.getCollapsedRepresentation(); if (new RefComparator().compare(collapsed, id) == 0) { return true; } } return m_delegate.containsVertexId(id, criteria); }
@Override public Vertex getVertex(VertexRef reference, Criteria... criteria) { for (CollapsibleCriteria criterium : getCollapsedCriteria(criteria)) { Vertex collapsed = criterium.getCollapsedRepresentation(); if (new RefComparator().compare(collapsed, reference) == 0) { return collapsed; } } return m_delegate.getVertex(reference, criteria); }
@Override public Vertex getVertex(VertexRef reference, Criteria... criteria) { for (CollapsibleCriteria criterium : getCollapsedCriteria(criteria)) { Vertex collapsed = criterium.getCollapsedRepresentation(); if (new RefComparator().compare(collapsed, reference) == 0) { return collapsed; } } return m_delegate.getVertex(reference, criteria); }
@Override public boolean containsVertexId(VertexRef id, Criteria... criteria) { for (CollapsibleCriteria criterium : getCollapsedCriteria(criteria)) { Vertex collapsed = criterium.getCollapsedRepresentation(); if (new RefComparator().compare(collapsed, id) == 0) { return true; } } return m_delegate.containsVertexId(id, criteria); }