Modifier and Type | Method and Description |
---|---|
java.util.TreeSet<Edge> |
Graph.getEdges()
Returns the TreeSet of edges.
|
java.util.TreeSet<Edge> |
Vertex.getIncidentEdges()
Returns a sorted
TreeSet containing the incident edges
to this Vertex . |
Modifier and Type | Method and Description |
---|---|
void |
Graph.addEdge(Edge e)
This adds the given
Edge to the Graph .
This also adds the Edge's vertices if they are not in the Graph . |
void |
Vertex.addIncidentEdge(Edge edge)
This add's an edge to the Vertex's list of incident edges.
|
int |
Edge.compareTo(Edge otherEdge)
This is the method inhereted from the Comparable interface.
|
boolean |
Graph.containsEdge(Edge e)
This tests to see if the
Graph contains the given edge. |
boolean |
Vertex.isIncidentTo(Edge e)
Tests whether this
Vertex is incident to the given
Edge . |
void |
Graph.removeEdge(Edge e)
This removes the
Edge from the set
of edges if it exists in the Graph . |
void |
Vertex.removeIncidentEdge(Edge edge)
This removes an edge from the Vertex's list of incident edges.
|