Class AbstractBaseGraph<V,E>
- All Implemented Interfaces:
Serializable
,Cloneable
,Graph<V,
E>
- Direct Known Subclasses:
DefaultDirectedGraph
,DirectedMultigraph
,DirectedPseudograph
,Multigraph
,Pseudograph
,SimpleDirectedGraph
,SimpleGraph
Graph
interface.
Its subclasses add various restrictions to get more specific graphs. The
decision whether it is directed or undirected is decided at construction time
and cannot be later modified (see constructor for details).
This graph implementation guarantees deterministic vertex and edge set
ordering (via LinkedHashMap
and LinkedHashSet
).
- Since:
- Jul 24, 2003
- Author:
- Barak Naveh
- See Also:
-
Constructor Summary
ConstructorsConstructorDescriptionAbstractBaseGraph
(EdgeFactory<V, E> ef, boolean allowMultipleEdges, boolean allowLoops) Construct a new pseudograph. -
Method Summary
Modifier and TypeMethodDescriptionCreates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.boolean
Adds the specified edge to this graph, going from the source vertex to the target vertex.boolean
Adds the specified vertex to this graph if not already present.clone()
Returns a shallow copy of this graph instance.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.int
edgeSet()
Returns a set of the edges contained in this graph.Returns a set of all edges touching the specified vertex.getAllEdges
(V sourceVertex, V targetVertex) Returns a set of all edges connecting source vertex to target vertex if such vertices exist in this graph.Returns an edge connecting source vertex to target vertex if such vertices and such edge exist in this graph.Returns the edge factory using which this graph creates new edges.getEdgeSource
(E e) Returns the source vertex of an edge.getEdgeTarget
(E e) Returns the target vertex of an edge.double
getEdgeWeight
(E e) Returns the weight assigned to a given edge.incomingEdgesOf
(V vertex) int
inDegreeOf
(V vertex) boolean
Returnstrue
if and only if self-loops are allowed in this graph.boolean
Returnstrue
if and only if multiple edges are allowed in this graph.int
outDegreeOf
(V vertex) outgoingEdgesOf
(V vertex) boolean
removeEdge
(E e) Removes the specified edge from the graph.removeEdge
(V sourceVertex, V targetVertex) Removes an edge going from source vertex to target vertex, if such vertices and such edge exist in this graph.boolean
removeVertex
(V v) Removes the specified vertex from this graph including all its touching edges if present.void
setEdgeSetFactory
(EdgeSetFactory<V, E> edgeSetFactory) Set theEdgeSetFactory
to use for this graph.void
setEdgeWeight
(E e, double weight) Returns a set of the vertices contained in this graph.Methods inherited from class org.jgrapht.graph.AbstractGraph
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets
Methods inherited from class java.lang.Object
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
Methods inherited from interface org.jgrapht.Graph
containsEdge, removeAllEdges, removeAllEdges, removeAllVertices
-
Constructor Details
-
AbstractBaseGraph
Construct a new pseudograph. The pseudograph can either be directed or undirected, depending on the specified edge factory.- Parameters:
ef
- the edge factory of the new graph.allowMultipleEdges
- whether to allow multiple edges or not.allowLoops
- whether to allow edges that are self-loops or not.- Throws:
NullPointerException
- if the specified edge factory isnull
.
-
-
Method Details
-
getAllEdges
Description copied from interface:Graph
Returns a set of all edges connecting source vertex to target vertex if such vertices exist in this graph. If any of the vertices does not exist or isnull
, returnsnull
. 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.
- Specified by:
getAllEdges
in interfaceGraph<V,
E> - Parameters:
sourceVertex
- source vertex of the edge.targetVertex
- target vertex of the edge.- Returns:
- a set of all edges connecting source vertex to target vertex.
- See Also:
-
isAllowingLoops
public boolean isAllowingLoops()Returnstrue
if and only if self-loops are allowed in this graph. A self loop is an edge that its source and target vertices are the same.- Returns:
true
if and only if graph loops are allowed.
-
isAllowingMultipleEdges
public boolean isAllowingMultipleEdges()Returnstrue
if and only if multiple edges are allowed in this graph. The meaning of multiple edges is that there can be many edges going from vertex v1 to vertex v2.- Returns:
true
if and only if multiple edges are allowed.
-
getEdge
Description copied from interface:Graph
Returns an edge connecting source vertex to target vertex if such vertices and such edge exist in this graph. Otherwise returnsnull
. If any of the specified vertices isnull
returnsnull
In undirected graphs, the returned edge may have its source and target vertices in the opposite order.
-
getEdgeFactory
Description copied from interface:Graph
Returns the edge factory using which this graph creates new edges. The edge factory is defined when the graph is constructed and must not be modified.- Specified by:
getEdgeFactory
in interfaceGraph<V,
E> - Returns:
- the edge factory using which this graph creates new edges.
- See Also:
-
setEdgeSetFactory
Set theEdgeSetFactory
to use for this graph. Initially, a graph is created with a default implementation which always supplies anArrayList
with capacity 1.- Parameters:
edgeSetFactory
- factory to use for subsequently created edge sets (this call has no effect on existing edge sets)
-
addEdge
Description copied from interface:Graph
Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge. 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 returnsnull
.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'sEdgeFactory
. For the new edge to be addede
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 edgee2
such thate2.equals(e)
. If suche2
is found then the newly created edgee
is abandoned, the method leaves this graph unchanged returnsnull
. -
addEdge
Description copied from interface:Graph
Adds the specified edge to this graph, going from the source vertex to the target vertex. More formally, adds the specified edge,e
, to this graph if this graph contains no edgee2
such thate2.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 returnsfalse
. If the edge was added to the graph, returnstrue
.The source and target vertices must already be contained in this graph. If they are not found in graph IllegalArgumentException is thrown.
-
addVertex
Description copied from interface:Graph
Adds the specified vertex to this graph if not already present. More formally, adds the specified vertex,v
, to this graph if this graph contains no vertexu
such thatu.equals(v)
. If this graph already contains such vertex, the call leaves this graph unchanged and returns false. In combination with the restriction on constructors, this ensures that graphs never contain duplicate vertices. -
getEdgeSource
Description copied from interface:Graph
Returns the source vertex of an edge. For an undirected graph, source and target are distinguishable designations (but without any mathematical meaning).- Specified by:
getEdgeSource
in interfaceGraph<V,
E> - Parameters:
e
- edge of interest- Returns:
- source vertex
- See Also:
-
getEdgeTarget
Description copied from interface:Graph
Returns the target vertex of an edge. For an undirected graph, source and target are distinguishable designations (but without any mathematical meaning).- Specified by:
getEdgeTarget
in interfaceGraph<V,
E> - Parameters:
e
- edge of interest- Returns:
- target vertex
- See Also:
-
clone
Returns a shallow copy of this graph instance. Neither edges nor vertices are cloned.- Overrides:
clone
in classObject
- Returns:
- a shallow copy of this set.
- Throws:
RuntimeException
- See Also:
-
containsEdge
Description copied from interface:Graph
Returns true if this graph contains the specified edge. More formally, returns true if and only if this graph contains an edgee2
such thate.equals(e2)
. If the specified edge isnull
returnsfalse
.- Specified by:
containsEdge
in interfaceGraph<V,
E> - Parameters:
e
- edge whose presence in this graph is to be tested.- Returns:
- true if this graph contains the specified edge.
- See Also:
-
containsVertex
Description copied from interface:Graph
Returns true if this graph contains the specified vertex. More formally, returns true if and only if this graph contains a vertexu
such thatu.equals(v)
. If the specified vertex isnull
returnsfalse
.- Specified by:
containsVertex
in interfaceGraph<V,
E> - Parameters:
v
- vertex whose presence in this graph is to be tested.- Returns:
- true if this graph contains the specified vertex.
- See Also:
-
degreeOf
- See Also:
-
edgeSet
Description copied from interface:Graph
Returns a set of the edges contained in this graph. The set is backed by the graph, so changes to the graph are reflected in the set. If the graph is modified while an iteration over the set is in progress, the results of the iteration are undefined.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. -
edgesOf
Description copied from interface:Graph
Returns a set of all edges touching the specified vertex. If no edges are touching the specified vertex returns an empty set. -
inDegreeOf
- See Also:
-
incomingEdgesOf
- See Also:
-
outDegreeOf
- See Also:
-
outgoingEdgesOf
- See Also:
-
removeEdge
Description copied from interface:Graph
Removes an edge going from source vertex to target vertex, if such vertices and such edge exist in this graph. Returns the edge if removed ornull
otherwise.- Specified by:
removeEdge
in interfaceGraph<V,
E> - Parameters:
sourceVertex
- source vertex of the edge.targetVertex
- target vertex of the edge.- Returns:
- The removed edge, or
null
if no edge removed. - See Also:
-
removeEdge
Description copied from interface:Graph
Removes the specified edge from the graph. Removes the specified edge from this graph if it is present. More formally, removes an edgee2
such thate2.equals(e)
, if the graph contains such edge. Returns true if the graph contained the specified edge. (The graph will not contain the specified edge once the call returns).If the specified edge is
null
returnsfalse
.- Specified by:
removeEdge
in interfaceGraph<V,
E> - Parameters:
e
- edge to be removed from this graph, if present.- Returns:
true
if and only if the graph contained the specified edge.- See Also:
-
removeVertex
Description copied from interface:Graph
Removes the specified vertex from this graph including all its touching edges if present. More formally, if the graph contains a vertexu
such thatu.equals(v)
, the call removes all edges that touchu
and then removesu
itself. If no suchu
is found, the call leaves the graph unchanged. Returns true if the graph contained the specified vertex. (The graph will not contain the specified vertex once the call returns).If the specified vertex is
null
returnsfalse
.- Specified by:
removeVertex
in interfaceGraph<V,
E> - Parameters:
v
- vertex to be removed from this graph, if present.- Returns:
true
if the graph contained the specified vertex;false
otherwise.- See Also:
-
vertexSet
Description copied from interface:Graph
Returns a set of the vertices contained in this graph. The set is backed by the graph, so changes to the graph are reflected in the set. If the graph is modified while an iteration over the set is in progress, the results of the iteration are undefined.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. -
getEdgeWeight
Description copied from interface:Graph
Returns the weight assigned to a given edge. Unweighted graphs return 1.0 (as defined byWeightedGraph.DEFAULT_EDGE_WEIGHT
), allowing weighted-graph algorithms to apply to them where meaningful.- Specified by:
getEdgeWeight
in interfaceGraph<V,
E> - Parameters:
e
- edge of interest- Returns:
- edge weight
- See Also:
-
setEdgeWeight
- See Also:
-