com.codemelon.graph.graph

Class UndirectedSimpleGraph<T extends UndirectedSimpleVertex>

java.lang.Object

com.codemelon.graph.graph.AbstractGraph<T>

com.codemelon.graph.graph.UndirectedSimpleGraph<T>

public class UndirectedSimpleGraph<T extends UndirectedSimpleVertex>
extends AbstractGraph<T>

Constructor Summary

Constructors

Constructor and Description
UndirectedSimpleGraph() Initialize graph to a default initial capacity of 16 vertices
UndirectedSimpleGraph(java.util.Collection<T> vertices) Use the vertices in a collection as the initial vertices in the graph
UndirectedSimpleGraph(int initialCapacity) Initialize graph to have capacity for the given number of vertices

Method Summary

Methods

Modifier and Type	Method and Description
int	edgeCount() Returns the number of edges in the graph.

Methods inherited from class com.codemelon.graph.graph.AbstractGraph

addVertex, containsEdge, containsVertex, getVertices, removeVertex, vertexCount, vertexIterator

Methods inherited from class java.lang.Object

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

Constructor Detail

UndirectedSimpleGraph

public UndirectedSimpleGraph()

Initialize graph to a default initial capacity of 16 vertices

UndirectedSimpleGraph

public UndirectedSimpleGraph(int initialCapacity)

Initialize graph to have capacity for the given number of vertices

Parameters:

initialCapacity - expected number of vertices

UndirectedSimpleGraph

public UndirectedSimpleGraph(java.util.Collection<T> vertices)

Use the vertices in a collection as the initial vertices in the graph

Parameters:

vertices - collection of vertices that will make up the initial vertices of the graph

Method Detail

edgeCount

public final int edgeCount()

Description copied from class: AbstractGraph

Returns the number of edges in the graph. This method is abstract because the implementation will differ in directed and undirected graphs.

Specified by:

edgeCount in class AbstractGraph<T extends UndirectedSimpleVertex>

Returns:

the number of edges in the graph