org.jgrapht.graph

Class UndirectedGraphUnion<V,E>

java.lang.Object

org.jgrapht.graph.AbstractGraph<V,E>

org.jgrapht.graph.GraphUnion<V,E,UndirectedGraph<V,E>>

org.jgrapht.graph.UndirectedGraphUnion<V,E>

Type Parameters:

V - the graph vertex type

E - the graph edge type

All Implemented Interfaces:

Serializable, Graph<V,E>, UndirectedGraph<V,E>

Deprecated.

In favor of AsGraphUnion.

@Deprecated
public class UndirectedGraphUnion<V,E>
extends GraphUnion<V,E,UndirectedGraph<V,E>>
implements UndirectedGraph<V,E>

An undirected version of the read-only union of two graphs.

See Also:

Serialized Form

Field Summary

Fields inherited from interface org.jgrapht.Graph

DEFAULT_EDGE_WEIGHT

Method Summary

Modifier and Type	Method and Description
int	degreeOf(V vertex) Deprecated. Returns the degree of the specified vertex.

Methods inherited from class org.jgrapht.graph.GraphUnion

addEdge, addEdge, addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, getG1, getG2, getType, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeWeight, vertexSet

Methods inherited from class org.jgrapht.graph.AbstractGraph

assertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface org.jgrapht.Graph

addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, getType, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, setEdgeWeight, vertexSet

Method Detail

degreeOf

public int degreeOf(V vertex)

Deprecated.

Description copied from interface: Graph

Returns the degree of the specified vertex.

A degree of a vertex in an undirected graph is the number of edges touching that vertex. Edges with same source and target vertices (self-loops) are counted twice.

In directed graphs this method returns the sum of the "in degree" and the "out degree".

Specified by:

degreeOf in interface Graph<V,E>

Overrides:

degreeOf in class GraphUnion<V,E,UndirectedGraph<V,E>>

Parameters:

vertex - vertex whose degree is to be calculated.

Returns:

the degree of the specified vertex.