lib.easyjava.graph.undirected

Class UnweightedUndirectedGraph<T>

java.lang.Object

lib.easyjava.graph.undirected.UndirectedGraph<T>

lib.easyjava.graph.undirected.UnweightedUndirectedGraph<T>

Type Parameters:

T - the type of the data to store in Vertices of this graph

All Implemented Interfaces:

java.io.Serializable, Graph<T>, UnweightedGraph<T>

public class UnweightedUndirectedGraph<T>
extends UndirectedGraph<T>
implements UnweightedGraph<T>

An unweighted undirected graph which contains Vertices which store data and Edges. All operations called on a graph or its components automatically manage the state of the entire graph, allowing many ways to interact with the graph.

Author:

Rob Rua (robrua@alumni.cmu.edu)

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
UnweightedUndirectedGraph() Creates a new unweighted undirected graph
UnweightedUndirectedGraph(java.util.Collection<T> vertexData) Creates a new unweighted undirected graph with the given data in vertices
UnweightedUndirectedGraph(MultiMap<T,T> connections) Creates a new unweighted undirected graph with the connections described by a multimap.

Method Summary

Modifier and Type	Method and Description
UndirectedEdge<T>	addEdge(Vertex<T> one, Vertex<T> other) Adds an edge to the graph between two Vertices
UnweightedUndirectedVertex<T>	addVertex(T data) Adds a new vertex to the graph with the given data

Methods inherited from class lib.easyjava.graph.undirected.UndirectedGraph

getEdges, getVertices, removeAllEdges, removeAllVertices, toString

Methods inherited from class java.lang.Object

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

Methods inherited from interface lib.easyjava.graph.Graph

getEdges, getVertices, removeAllEdges, removeAllVertices

Constructor Detail

UnweightedUndirectedGraph

public UnweightedUndirectedGraph()

Creates a new unweighted undirected graph

UnweightedUndirectedGraph

public UnweightedUndirectedGraph(java.util.Collection<T> vertexData)

Creates a new unweighted undirected graph with the given data in vertices

Parameters:

vertexData - the data to make vertices out of

UnweightedUndirectedGraph

public UnweightedUndirectedGraph(MultiMap<T,T> connections)

Creates a new unweighted undirected graph with the connections described by a multimap. An edge will be made from each key to each of its values

Parameters:

connections - the connections to build the graph out of

Method Detail

addEdge

public UndirectedEdge<T> addEdge(Vertex<T> one,
                                 Vertex<T> other)

Description copied from interface: UnweightedGraph

Adds an edge to the graph between two Vertices

Specified by:

addEdge in interface UnweightedGraph<T>

Parameters:

one - the Vertex the edge starts at (arbitrary for undirected graphs)

other - the Vertex the edge ends at (arbitrary for undirected graphs)

Returns:

the created edge

addVertex

public UnweightedUndirectedVertex<T> addVertex(T data)

Description copied from interface: Graph

Adds a new vertex to the graph with the given data

Specified by:

addVertex in interface Graph<T>

Parameters:

data - the data to add to the graph

Returns:

the Vertex that was created