edu.umd.cs.findbugs.graph
public interface Graph<EdgeType extends GraphEdge<EdgeType,VertexType>,VertexType extends GraphVertex<VertexType>>
Method Summary | |
---|---|
void | addVertex(VertexType v)
Add given vertex to the graph.
|
boolean | containsVertex(VertexType v)
Determine if the graph contains the given vertex.
|
EdgeType | createEdge(VertexType source, VertexType target)
Add a new edge to the graph.
|
Iterator<EdgeType> | edgeIterator()
Get Iterator over all edges in the graph. |
int | getNumEdgeLabels()
Get the number of numeric labels that have been assigned to edges. |
int | getNumEdges()
Get number of edges in the graph. |
int | getNumIncomingEdges(VertexType vertex)
Get number of edges going into given vertex.
|
int | getNumOutgoingEdges(VertexType vertex)
Get number of edges going out of given vertex.
|
int | getNumVertexLabels()
Get the number of numeric (integer) labels that have been assigned to vertices
in the graph. |
int | getNumVertices()
Get number of vertices in the graph. |
Iterator<EdgeType> | incomingEdgeIterator(VertexType target)
Get an Iterator over incoming edges to a given vertex.
|
EdgeType | lookupEdge(VertexType source, VertexType target)
Look up an edge by source and target vertex.
|
Iterator<EdgeType> | outgoingEdgeIterator(VertexType source)
Get an Iterator over outgoing edges from given vertex.
|
Iterator<VertexType> | predecessorIterator(VertexType target)
Get an iterator over the predecessors of this vertex;
i.e., the sources of the vertex's incoming edges.
|
void | removeEdge(EdgeType e)
Remove given edge from the graph. |
void | removeVertex(VertexType v)
Remove given vertex from the graph.
|
void | setNumEdgeLabels(int numLabels)
Reset the number of edge labels. |
void | setNumVertexLabels(int numLabels)
Reset number of (integer) labels. |
Iterator<VertexType> | successorIterator(VertexType source)
Get an iterator over the successors of this vertex;
i.e., the targets of the vertex's outgoing edges.
|
Iterator<VertexType> | vertexIterator()
Get Iterator over all vertices in the graph. |
Parameters: v the vertex to add
Parameters: v the vertex
Returns: true if the vertex is part of the graph, false if not
Parameters: source the source vertex target the target vertex
Returns: the new edge
Parameters: vertex the vertex
Returns: number of edges going into the vertex
Parameters: vertex the vertex
Returns: number of edges going out of the vertex
Parameters: target the target vertex
Returns: an Iterator over incoming edges
Parameters: source the source vertex target the target vertex
Returns: a matching edge, or null if there is no matching edge
Parameters: source the source vertex
Returns: an Iterator over outgoing edges
Parameters: target the target vertex
Returns: an Iterator over the predecessors of the vertex
Parameters: source the source vertex
Returns: an Iterator over the successors of the vertex