V
 the vertex typeE
 the edge typeG
 the graph type of the two graphs that are combinedpublic class GraphUnion<V,E,G extends Graph<V,E>> extends AbstractGraph<V,E> implements Serializable
Readonly union of two graphs: G_{1} and G_{2}. If G_{1} = (V_{1}, E_{1}) and G_{2} = (V_{2}, E_{2}) then their union G = (V, E), where V is the union of V_{1} and V_{2}, and E is the union of E_{1} and E_{1}.
GraphUnion implements Graph interface. GraphUnion uses WeightCombiner to choose policy for calculating edge weight.
Constructor and Description 

GraphUnion(G g1,
G g2)
Construct a new graph union.

GraphUnion(G g1,
G g2,
WeightCombiner operator)
Construct a new graph union.

Modifier and Type  Method and Description 

E 
addEdge(V sourceVertex,
V targetVertex)
Throws UnsupportedOperationException, because
GraphUnion is readonly.

boolean 
addEdge(V sourceVertex,
V targetVertex,
E e)
Throws UnsupportedOperationException, because
GraphUnion is readonly.

boolean 
addVertex(V v)
Throws UnsupportedOperationException, because
GraphUnion is readonly.

boolean 
containsEdge(E e)
Returns true if this graph contains the specified edge.

boolean 
containsVertex(V v)
Returns true if this graph contains the specified vertex.

Set<E> 
edgeSet()
Returns a set of the edges contained in this graph.

Set<E> 
edgesOf(V vertex)
Returns a set of all edges touching 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.

EdgeFactory<V,E> 
getEdgeFactory()
Throws UnsupportedOperationException, because
GraphUnion is readonly.

V 
getEdgeSource(E e)
Returns the source vertex of an edge.

V 
getEdgeTarget(E e)
Returns the target vertex of an edge.

double 
getEdgeWeight(E e)
Returns the weight assigned to a given edge.

G 
getG1()
Return G_{1}

G 
getG2()
Return G_{2}

boolean 
removeEdge(E e)
Throws UnsupportedOperationException, because
GraphUnion is readonly.

E 
removeEdge(V sourceVertex,
V targetVertex)
Throws UnsupportedOperationException, because
GraphUnion is readonly.

boolean 
removeVertex(V v)
Throws UnsupportedOperationException, because
GraphUnion is readonly.

Set<V> 
vertexSet()
Returns a set of the vertices contained in this graph.

assertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets
public GraphUnion(G g1, G g2, WeightCombiner operator)
g1
 the first graphg2
 the second graphoperator
 the weight combiner (policy for edge weight calculation)public GraphUnion(G g1, G g2)
WeightCombiner.SUM
weight
combiner.g1
 the first graphg2
 the second graphpublic Set<E> getAllEdges(V sourceVertex, V targetVertex)
Graph
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>
sourceVertex
 source vertex of the edge.targetVertex
 target vertex of the edge.public E getEdge(V sourceVertex, V targetVertex)
Graph
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 EdgeFactory<V,E> getEdgeFactory()
getEdgeFactory
in interface Graph<V,E>
public E addEdge(V sourceVertex, V targetVertex)
addEdge
in interface Graph<V,E>
sourceVertex
 source vertex of the edge.targetVertex
 target vertex of the edge.
null
.Graph.getEdgeFactory()
public boolean addEdge(V sourceVertex, V targetVertex, E e)
addEdge
in interface Graph<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)
,
Graph.getEdgeFactory()
public boolean addVertex(V v)
public boolean containsEdge(E e)
Graph
e2
such that
e.equals(e2)
. If the specified edge is null
returns
false
.containsEdge
in interface Graph<V,E>
e
 edge whose presence in this graph is to be tested.public boolean containsVertex(V v)
Graph
u
such that
u.equals(v)
. If the specified vertex is null
returns
false
.containsVertex
in interface Graph<V,E>
v
 vertex whose presence in this graph is to be tested.public Set<E> edgeSet()
Graph
The graph implementation may maintain a particular set ordering (e.g. via
LinkedHashSet
) for deterministic iteration, but this is not required. It is
the responsibility of callers who rely on this behavior to only use graph implementations
which support it.
public Set<E> edgesOf(V vertex)
Graph
public E removeEdge(V sourceVertex, V targetVertex)
removeEdge
in interface Graph<V,E>
sourceVertex
 source vertex of the edge.targetVertex
 target vertex of the edge.null
if no edge removed.public boolean removeEdge(E e)
removeEdge
in interface Graph<V,E>
e
 edge to be removed from this graph, if present.true
if and only if the graph contained the specified edge.public boolean removeVertex(V v)
removeVertex
in interface Graph<V,E>
v
 vertex to be removed from this graph, if present.true
if the graph contained the specified vertex; false
otherwise.public Set<V> vertexSet()
Graph
The graph implementation may maintain a particular set ordering (e.g. via
LinkedHashSet
) for deterministic iteration, but this is not required. It is
the responsibility of callers who rely on this behavior to only use graph implementations
which support it.
public V getEdgeSource(E e)
Graph
getEdgeSource
in interface Graph<V,E>
e
 edge of interestpublic V getEdgeTarget(E e)
Graph
getEdgeTarget
in interface Graph<V,E>
e
 edge of interestpublic double getEdgeWeight(E e)
Graph
WeightedGraph.DEFAULT_EDGE_WEIGHT
), allowing weightedgraph algorithms to apply to
them where meaningful.getEdgeWeight
in interface Graph<V,E>
e
 edge of interestWeightedGraph
public G getG1()
public G getG2()
Copyright © 2017. All rights reserved.