V
 the graph vertex typeE
 the graph edge typepublic class AsUndirectedGraph<V,E> extends GraphDelegator<V,E> implements Serializable, UndirectedGraph<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.
Constructor and Description 

AsUndirectedGraph(DirectedGraph<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.

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, containsEdge, containsVertex, edgeSet, edgesOf, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeEdge, removeEdge, removeVertex, setEdgeWeight, vertexSet
assertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSets
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet
public AsUndirectedGraph(DirectedGraph<V,E> g)
g
 the backing directed graph over which an undirected view is to be created.public Set<E> getAllEdges(V sourceVertex, V targetVertex)
GraphDelegator
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.Graph.getAllEdges(Object, Object)
public E getEdge(V sourceVertex, V targetVertex)
GraphDelegator
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.
getEdge
in interface Graph<V,E>
getEdge
in class GraphDelegator<V,E>
sourceVertex
 source vertex of the edge.targetVertex
 target vertex of the edge.Graph.getEdge(Object, Object)
public E addEdge(V sourceVertex, V targetVertex)
GraphDelegator
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 EdgeFactory
.
For the new edge to be added e
must not be equal to any other edge the
graph (even if the graph allows edgemultiplicity). 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 returns
null
.
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
.Graph.addEdge(Object, Object)
public boolean addEdge(V sourceVertex, V targetVertex, E e)
GraphDelegator
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 edgemultiplicity. 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.Graph.addEdge(Object, Object, Object)
public int degreeOf(V vertex)
GraphDelegator
degreeOf
in interface UndirectedGraph<V,E>
degreeOf
in class GraphDelegator<V,E>
vertex
 vertex whose degree is to be calculatedUndirectedGraph.degreeOf(Object)
public int inDegreeOf(V vertex)
GraphDelegator
inDegreeOf
in class GraphDelegator<V,E>
vertex
 vertex whose in degree is to be calculatedDirectedGraph.inDegreeOf(Object)
public Set<E> incomingEdgesOf(V vertex)
GraphDelegator
incomingEdgesOf
in class GraphDelegator<V,E>
vertex
 the vertex for which the list of incoming edges to be returnedDirectedGraph.incomingEdgesOf(Object)
public int outDegreeOf(V vertex)
GraphDelegator
outDegreeOf
in class GraphDelegator<V,E>
vertex
 vertex whose out degree is to be calculatedDirectedGraph.outDegreeOf(Object)
public Set<E> outgoingEdgesOf(V vertex)
GraphDelegator
outgoingEdgesOf
in class GraphDelegator<V,E>
vertex
 the vertex for which the list of outgoing edges to be returnedDirectedGraph.outgoingEdgesOf(Object)
public String toString()
GraphDelegator
toString
in class GraphDelegator<V,E>
AbstractGraph.toString()
Copyright © 2016. All rights reserved.