|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
public interface MutableGraph<N extends Graph.Node<N,E>,E extends Graph.Edge<N,E>>
A MutableGraph is a a Graph which can
be modified. The methods allow the removal and addition of edges and
nodes to the graph.
| Nested Class Summary |
|---|
| Nested classes/interfaces inherited from interface harpoon.Util.Collections.Graph |
|---|
Graph.Edge<N extends Graph.Node<N,E>,E extends Graph.Edge<N,E>>, Graph.Node<N extends Graph.Node<N,E>,E extends Graph.Edge<N,E>> |
| Method Summary | |
|---|---|
E |
addEdge(N from,
N to)
Add an edge from from to to and return
the new edge. |
void |
addNode(N node)
Add a new node to the graph. |
void |
removeEdge(E edge)
Remove the given edge from the graph. |
void |
summarize(Collection<N> nodesToRemove)
Remove all specified nodes, preserving path information. |
void |
summarize(N nodeToRemove)
Remove the given node, preserving edges: if A->N->B, then after removing N there is an edge A->B. |
| Methods inherited from interface harpoon.Util.Collections.Graph |
|---|
nodes |
| Method Detail |
|---|
void addNode(N node)
E addEdge(N from,
N to)
from to to and return
the new edge.
void removeEdge(E edge)
void summarize(N nodeToRemove)
void summarize(Collection<N> nodesToRemove)
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||