V - the graph vertex typeE - the graph edge typepublic class AsUndirectedGraph<V,E> extends GraphDelegator<V,E> implements Serializable, Graph<V,E>
UnsupportedOperationException, but vertex addition/removal and edge removal are all
supported (and immediately reflected in the backing graph).
Note that edges returned by this graph's accessors are really just the edges of the underlying directed graph. Since there is no interface distinction between directed and undirected edges, this detail should be irrelevant to algorithms.
This graph does not pass the hashCode and equals operations through to the backing graph, but relies on Object's equals and hashCode methods. This graph will be serializable if the backing graph is serializable.
DEFAULT_EDGE_WEIGHT| Constructor and Description |
|---|
AsUndirectedGraph(Graph<V,E> g)
Constructor for AsUndirectedGraph.
|
| Modifier and Type | Method and Description |
|---|---|
E |
addEdge(V sourceVertex,
V targetVertex)
Creates a new edge in this graph, going from the source vertex to the target vertex, and
returns the created edge.
|
boolean |
addEdge(V sourceVertex,
V targetVertex,
E e)
Adds the specified edge to this graph, going from the source vertex to the target vertex.
|
int |
degreeOf(V vertex)
Returns the degree of the specified vertex.
|
Set<E> |
getAllEdges(V sourceVertex,
V targetVertex)
Returns a set of all edges connecting source vertex to target vertex if such vertices exist
in this graph.
|
E |
getEdge(V sourceVertex,
V targetVertex)
Returns an edge connecting source vertex to target vertex if such vertices and such edge
exist in this graph.
|
GraphType |
getType()
Get the graph type.
|
Set<E> |
incomingEdgesOf(V vertex)
Returns a set of all edges incoming into the specified vertex.
|
int |
inDegreeOf(V vertex)
Returns the "in degree" of the specified vertex.
|
int |
outDegreeOf(V vertex)
Returns the "out degree" of the specified vertex.
|
Set<E> |
outgoingEdgesOf(V vertex)
Returns a set of all edges outgoing from the specified vertex.
|
String |
toString()
Returns a string of the parenthesized pair (V, E) representing this G=(V,E) graph.
|
addVertex, addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getDelegate, getEdgeSource, getEdgeSupplier, getEdgeTarget, getEdgeWeight, getVertexSupplier, removeEdge, removeEdge, removeVertex, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitaddVertex, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getEdgeSource, getEdgeSupplier, getEdgeTarget, getEdgeWeight, getVertexSupplier, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, setEdgeWeight, setEdgeWeight, vertexSetpublic AsUndirectedGraph(Graph<V,E> g)
g - the backing directed graph over which an undirected view is to be created.IllegalArgumentException - if the graph is not directedpublic Set<E> getAllEdges(V sourceVertex, V targetVertex)
null, returns
null. If both vertices exist but no edges found, returns an empty set.
In undirected graphs, some of the returned edges may have their source and target vertices in the opposite order. In simple graphs the returned set is either singleton set or empty set.
getAllEdges in interface Graph<V,E>getAllEdges in class GraphDelegator<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.public E getEdge(V sourceVertex, V targetVertex)
null. If any of the specified vertices is null returns null
In undirected graphs, the returned edge may have its source and target vertices in the opposite order.
public E addEdge(V sourceVertex, V targetVertex)
null.
The source and target vertices must already be contained in this graph. If they are not found
in graph IllegalArgumentException is thrown.
This method creates the new edge e using this graph's edge supplier (see
Graph.getEdgeSupplier()). For the new edge to be added e must not be
equal to any other edge the graph (even if the graph allows edge-multiplicity). More
formally, the graph must not contain any edge e2 such that
e2.equals(e). If such
e2 is found then the newly created edge e is abandoned, the method leaves
this graph unchanged and returns null.
If the underlying graph implementation's Graph.getEdgeSupplier() returns
null, then this method cannot create edges and throws an
UnsupportedOperationException.
addEdge in interface Graph<V,E>addEdge in class GraphDelegator<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.
null.UnsupportedOperationException - always, since operation is unsupportedGraph.getEdgeSupplier()public boolean addEdge(V sourceVertex, V targetVertex, E e)
e, to this graph if this graph contains no edge e2 such that
e2.equals(e). If this graph already contains such an edge, the call leaves this
graph unchanged and returns false. Some graphs do not allow edge-multiplicity. In
such cases, if the graph already contains an edge from the specified source to the specified
target, than this method does not change the graph and returns
false. If the edge was added to the graph, returns
true.
The source and target vertices must already be contained in this graph. If they are not found in graph IllegalArgumentException is thrown.
addEdge in interface Graph<V,E>addEdge in class GraphDelegator<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.e - edge to be added to this graph.UnsupportedOperationException - always, since operation is unsupportedGraph.addEdge(Object, Object),
Graph.getEdgeSupplier()public int degreeOf(V vertex)
public Set<E> incomingEdgesOf(V vertex)
In the case of undirected graphs this method returns all edges touching the vertex, thus, some of the returned edges may have their source and target vertices in the opposite order.
incomingEdgesOf in interface Graph<V,E>incomingEdgesOf in class GraphDelegator<V,E>vertex - the vertex for which the list of incoming edges to be returned.public int inDegreeOf(V vertex)
The "in degree" of a vertex in a directed graph is the number of inward directed edges from that vertex. See http://mathworld.wolfram.com/Indegree.html.
In the case of undirected graphs this method returns the number of edges touching the vertex. Edges with same source and target vertices (self-loops) are counted twice.
inDegreeOf in interface Graph<V,E>inDegreeOf in class GraphDelegator<V,E>vertex - vertex whose degree is to be calculated.public Set<E> outgoingEdgesOf(V vertex)
In the case of undirected graphs this method returns all edges touching the vertex, thus, some of the returned edges may have their source and target vertices in the opposite order.
outgoingEdgesOf in interface Graph<V,E>outgoingEdgesOf in class GraphDelegator<V,E>vertex - the vertex for which the list of outgoing edges to be returned.public int outDegreeOf(V vertex)
The "out degree" of a vertex in a directed graph is the number of outward directed edges from that vertex. See http://mathworld.wolfram.com/Outdegree.html.
In the case of undirected graphs this method returns the number of edges touching the vertex. Edges with same source and target vertices (self-loops) are counted twice.
outDegreeOf in interface Graph<V,E>outDegreeOf in class GraphDelegator<V,E>vertex - vertex whose degree is to be calculated.public GraphType getType()
public String toString()
toString in class GraphDelegator<V,E>Copyright © 2019. All rights reserved.