org.jgraphl.graph

Class MutableUndirectedAdjacencyGraph<V>

java.lang.Object

org.jgraphl.graph.AbstractAdjacencyGraph<V>

org.jgraphl.graph.UndirectedAdjacencyGraph<V>

org.jgraphl.graph.MutableUndirectedAdjacencyGraph<V>

All Implemented Interfaces:

Iterable<V>, AdjacencyGraph<V>, Graph<V>, IncidenceGraph<V>, MutableGraph<V>, UndirectedGraph<V>

public class MutableUndirectedAdjacencyGraph<V>
extends UndirectedAdjacencyGraph<V>
implements MutableGraph<V>, UndirectedGraph<V>

Constructor Summary

Constructors

Constructor and Description
MutableUndirectedAdjacencyGraph()
MutableUndirectedAdjacencyGraph(Map<V,Collection<V>> adjListMap)
MutableUndirectedAdjacencyGraph(Map<V,Collection<V>> adjListMap, Supplier<Collection<V>> adjListSupplier)

Method Summary

Modifier and Type	Method and Description
MutableUndirectedAdjacencyGraph<V>	addEdge(V sourceVertex, V targetVertex) Inserts the edge (u,v) into the graph, and returns an edge descriptor pointing to the new edge.
MutableUndirectedAdjacencyGraph<V>	addVertex(V v)
MutableUndirectedAdjacencyGraph<V>	removeEdge(V sourceVertex, V targetVertex) Remove the edge(u,v) from the graph.
MutableUndirectedAdjacencyGraph<V>	removeVertex(V v) Remove u from the vertex set of the graph.

Methods inherited from class org.jgraphl.graph.UndirectedAdjacencyGraph

containsEdge, containsEdge

Methods inherited from class org.jgraphl.graph.AbstractAdjacencyGraph

adjacentVertices, contains, forEachAdjacentEdge, forEachAdjacentVertex, iterator, noOfVertices, outEdges, toString

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface org.jgraphl.MutableGraph

addEdge, removeEdge

Methods inherited from interface org.jgraphl.UndirectedGraph

isDirected

Methods inherited from interface org.jgraphl.Graph

contains, containsEdge, containsEdge, edges, edgeStream, edgeSupplier, forEachEdge, forEachVertex, getEdge, noOfEdges, noOfVertices, sortedEdgeStreamToString, str, stream, vertices

Methods inherited from interface java.lang.Iterable

forEach, iterator, spliterator

Methods inherited from interface org.jgraphl.AdjacencyGraph

adjacentVertices, forEachAdjacentVertex

Methods inherited from interface org.jgraphl.IncidenceGraph

outDegree

Constructor Detail

MutableUndirectedAdjacencyGraph

public MutableUndirectedAdjacencyGraph(Map<V,Collection<V>> adjListMap,
                                       Supplier<Collection<V>> adjListSupplier)

MutableUndirectedAdjacencyGraph

public MutableUndirectedAdjacencyGraph(Map<V,Collection<V>> adjListMap)

MutableUndirectedAdjacencyGraph

public MutableUndirectedAdjacencyGraph()

Method Detail

addVertex

public MutableUndirectedAdjacencyGraph<V> addVertex(V v)

Specified by:

addVertex in interface MutableGraph<V>

addEdge

public MutableUndirectedAdjacencyGraph<V> addEdge(V sourceVertex,
                                                  V targetVertex)

Description copied from interface: MutableGraph

Inserts the edge (u,v) into the graph, and returns an edge descriptor pointing to the new edge. If the graph disallows parallel edges, and the edge (u,v) is already in the graph, then the bool flag returned is false and the returned edge descriptor points to the already existing edge. Note that for undirected graphs, (u,v) is the same edge as (v,u), so after a call to the function add_edge(), this implies that edge (u,v) will appear in the out-edges of u and (u,v) (or equivalently (v,u)) will appear in the out-edges of v. Put another way, v will be adjacent to u and u will be adjacent to v.

Specified by:

addEdge in interface MutableGraph<V>

Returns:

this graph

removeVertex

public MutableUndirectedAdjacencyGraph<V> removeVertex(V v)

Description copied from interface: MutableGraph

Remove u from the vertex set of the graph.

Specified by:

removeVertex in interface MutableGraph<V>

Returns:

this graph

removeEdge

public MutableUndirectedAdjacencyGraph<V> removeEdge(V sourceVertex,
                                                     V targetVertex)

Description copied from interface: MutableGraph

Remove the edge(u,v) from the graph. If the graph allows parallel edges this remove all occurrences of (u,v).

Specified by:

removeEdge in interface MutableGraph<V>

Returns:

this graph