T
- type of nodes in this graphU
- types of edge labels.public interface LabeledEdgeManager<T,U> extends EdgeManager<T>
Modifier and Type | Method and Description |
---|---|
void |
addEdge(T src,
T dst,
U label)
adds an edge with some label
|
U |
getDefaultLabel()
Sets the default object used as label for operations where no specific edge label is provided.
|
Set<? extends U> |
getEdgeLabels(T src,
T dst)
Returns a set of all labeled edges between node src and node dst
|
Iterator<? extends U> |
getPredLabels(T N) |
int |
getPredNodeCount(T N,
U label)
Return the number of
immediate predecessor nodes of this Node in the Graph on edges with some label. |
Iterator<T> |
getPredNodes(T N,
U label)
Return an Iterator over the immediate predecessor nodes of this Node in the Graph on edges with some label.
|
Iterator<? extends U> |
getSuccLabels(T N) |
int |
getSuccNodeCount(T N,
U label)
Return the number of
immediate successor nodes of this Node in the Graph |
Iterator<? extends T> |
getSuccNodes(T N,
U label)
Return an Iterator over the immediate successor nodes of this Node in the Graph on edges with some label.
|
boolean |
hasEdge(T src,
T dst,
U label) |
void |
removeEdge(T src,
T dst,
U label) |
addEdge, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeOutgoingEdges
U getDefaultLabel()
Iterator<T> getPredNodes(T N, U label)
null
.Iterator<? extends U> getPredLabels(T N)
N
- int getPredNodeCount(T N, U label)
immediate predecessor
nodes of this Node in the Graph on edges with some label.Iterator<? extends T> getSuccNodes(T N, U label)
This method never returns null
.
Iterator<? extends U> getSuccLabels(T N)
int getSuccNodeCount(T N, U label)
immediate successor
nodes of this Node in the Graphvoid removeEdge(T src, T dst, U label) throws UnsupportedOperationException
UnsupportedOperationException