@Override public int getSuccNodeCount(T N) { int count = 0; for (U label : nodeToSuccLabels.get(N)) { count += getSuccNodeCount(N, label); } return count; }
@Override public int getPredNodeCount(T N) { int count = 0; for (U label : nodeToPredLabels.get(N)) { count += getPredNodeCount(N, label); } return count; }
@Override public int getPredNodeCount(T N) { int count = 0; for (U label : nodeToPredLabels.get(N)) { count += getPredNodeCount(N, label); } return count; }
@Override public int getPredNodeCount(T N) { int count = 0; for (U label : nodeToPredLabels.get(N)) { count += getPredNodeCount(N, label); } return count; }
@Override public int getSuccNodeCount(T N) { int count = 0; for (U label : nodeToSuccLabels.get(N)) { count += getSuccNodeCount(N, label); } return count; }
@Override public int getSuccNodeCount(T N) { int count = 0; for (U label : nodeToSuccLabels.get(N)) { count += getSuccNodeCount(N, label); } return count; }
@Override public Iterator<? extends U> getSuccLabels(T N) { return nodeToSuccLabels.get(N).iterator(); }
@Override public void removeIncomingEdges(T node) throws IllegalArgumentException { for (U label : nodeToPredLabels.get(node)) { getManagerForLabel(label).removeIncomingEdges(node); } }
@Override public Iterator<T> getPredNodes(T N) { Collection<T> preds = HashSetFactory.make(); for (U label : nodeToPredLabels.get(N)) { preds.addAll(Iterator2Collection.toSet(getPredNodes(N, label))); } return preds.iterator(); }
@Override public Iterator<T> getPredNodes(T N) { Collection<T> preds = HashSetFactory.make(); for (U label : nodeToPredLabels.get(N)) { preds.addAll(Iterator2Collection.toSet(getPredNodes(N, label))); } return preds.iterator(); }
@Override public Iterator<T> getPredNodes(T N) { Collection<T> preds = HashSetFactory.make(); for (U label : nodeToPredLabels.get(N)) { preds.addAll(Iterator2Collection.toSet(getPredNodes(N, label))); } return preds.iterator(); }
@Override public void removeIncomingEdges(T node) throws IllegalArgumentException { for (U label : nodeToPredLabels.get(node)) { getManagerForLabel(label).removeIncomingEdges(node); } }
@Override public void removeOutgoingEdges(T node) throws IllegalArgumentException { for (U label : nodeToSuccLabels.get(node)) { getManagerForLabel(label).removeOutgoingEdges(node); } }
@Override public void removeOutgoingEdges(T node) throws IllegalArgumentException { for (U label : nodeToSuccLabels.get(node)) { getManagerForLabel(label).removeOutgoingEdges(node); } }
@Override public void removeOutgoingEdges(T node) throws IllegalArgumentException { for (U label : nodeToSuccLabels.get(node)) { getManagerForLabel(label).removeOutgoingEdges(node); } }
@Override public Iterator<T> getSuccNodes(T N) { Collection<T> succs = HashSetFactory.make(); for (U label : nodeToSuccLabels.get(N)) { succs.addAll(Iterator2Collection.toSet(getSuccNodes(N, label))); } return succs.iterator(); }
@Override public IntSet getSuccNodeNumbers(T node) { BitVectorIntSet succs = new BitVectorIntSet(); for (U label : nodeToSuccLabels.get(node)) { succs.addAll(getSuccNodeNumbers(node, label)); } return succs; }
@Override public IntSet getPredNodeNumbers(T node) { BitVectorIntSet preds = new BitVectorIntSet(); for (U label : nodeToPredLabels.get(node)) { preds.addAll(getPredNodeNumbers(node, label)); } return preds; }
@Override public IntSet getSuccNodeNumbers(T node) { BitVectorIntSet succs = new BitVectorIntSet(); for (U label : nodeToSuccLabels.get(node)) { succs.addAll(getSuccNodeNumbers(node, label)); } return succs; }
@Override public IntSet getPredNodeNumbers(T node) { BitVectorIntSet preds = new BitVectorIntSet(); for (U label : nodeToPredLabels.get(node)) { preds.addAll(getPredNodeNumbers(node, label)); } return preds; }