squidpony.squidai.graph

Class UndirectedGraph<V>

java.lang.Object

squidpony.squidai.graph.Graph<V>

squidpony.squidai.graph.UndirectedGraph<V>

Type Parameters:

V - the vertex type; often Coord

All Implemented Interfaces:

java.io.Serializable

Direct Known Subclasses:

DefaultGraph

public class UndirectedGraph<V>
extends Graph<V>
implements java.io.Serializable

A kind of Graph where all connections between vertices are two-way and have equal cost for traveling A to B or B to A.

See Also:

The DefaultGraph class supports the common case where V is Coord and all costs are 1., Serialized Form

Field Summary

Fields inherited from class squidpony.squidai.graph.Graph

edgeMap, vertexMap

Constructor Summary

Constructors

Constructor and Description
UndirectedGraph()
UndirectedGraph(java.util.Collection<V> vertices)

Method Summary

Modifier and Type	Method and Description
protected Connection<V>	addConnection(Node<V> a, Node<V> b, float weight)
UndirectedGraphAlgorithms<V>	algorithms()
protected Graph<V>	createNew()
protected Connection<V>	getEdge(Node<V> a, Node<V> b)
boolean	isDirected() Check if the graph is directed, that is whether the edges form an ordered pair or a set.
protected Connection<V>	obtainEdge()
protected boolean	removeConnection(Node<V> a, Node<V> b)

Methods inherited from class squidpony.squidai.graph.Graph

addConnection, addEdge, addEdge, addVertex, addVertices, connectionExists, contains, edgeExists, getEdge, getEdgeCount, getEdges, getEdges, getNode, getNodes, getVertices, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeNode, removeVertex, removeVertices, size, sortEdges, sortVertices

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

UndirectedGraph

public UndirectedGraph()

UndirectedGraph

public UndirectedGraph(java.util.Collection<V> vertices)

Method Detail

obtainEdge

protected Connection<V> obtainEdge()

Specified by:

obtainEdge in class Graph<V>

addConnection

protected Connection<V> addConnection(Node<V> a,
                                      Node<V> b,
                                      float weight)

Overrides:

addConnection in class Graph<V>

removeConnection

protected boolean removeConnection(Node<V> a,
                                   Node<V> b)

Overrides:

removeConnection in class Graph<V>

getEdge

protected Connection<V> getEdge(Node<V> a,
                                Node<V> b)

Overrides:

getEdge in class Graph<V>

isDirected

public boolean isDirected()

Description copied from class: Graph

Check if the graph is directed, that is whether the edges form an ordered pair or a set.

Overrides:

isDirected in class Graph<V>

Returns:

whether the graph is directed

createNew

protected Graph<V> createNew()

Specified by:

createNew in class Graph<V>

algorithms

public UndirectedGraphAlgorithms<V> algorithms()

Specified by:

algorithms in class Graph<V>