Class UndirectedGraph<V>

java.lang.Object

com.github.yellowstonegames.path.Graph<V>

com.github.yellowstonegames.path.UndirectedGraph<V>

Type Parameters:

V - the vertex type; often Coord

All Implemented Interfaces:

Externalizable, Serializable

Direct Known Subclasses:

DefaultGraph

public class UndirectedGraph<V>
extends Graph<V>

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

Modifier and Type	Field	Description
protected UndirectedGraphAlgorithms<V>	algorithms

Fields inherited from class Graph

edgeSet, vertexMap

Constructor Summary

Constructors

Constructor	Description
UndirectedGraph()
UndirectedGraph(Collection<V> vertices)

Method Summary

Modifier and Type	Method	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)
String	toString()

Methods inherited from class Graph

addConnection, addEdge, addEdge, addVertex, addVertices, addVertices, connectionExists, contains, disconnect, disconnect, edgeExists, equals, getEdge, getEdgeCount, getEdges, getEdges, getNode, getNodes, getVertices, hashCode, readExternal, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeEdgeIf, removeEdges, removeNode, removeVertex, removeVertexIf, removeVertices, size, sortEdges, sortVertices, writeExternal

Methods inherited from class Object

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

Field Details

algorithms

protected UndirectedGraphAlgorithms<V> algorithms

Constructor Details

UndirectedGraph

public UndirectedGraph()

UndirectedGraph

public UndirectedGraph(Collection<V> vertices)

Method Details

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>

toString

public String toString()

Overrides:

toString in class Object