com.codemelon.graph.graph

Class DfsGraph<E extends DfsEdgeData>

java.lang.Object

com.codemelon.graph.graph.AbstractGraph<V>

com.codemelon.graph.graph.DirectedEdgeDataGraph<E,DirectedDfsVertex<E>>

com.codemelon.graph.graph.DfsGraph<E>

public class DfsGraph<E extends DfsEdgeData>
extends DirectedEdgeDataGraph<E,DirectedDfsVertex<E>>

Utility class that eliminates one type parameter from DirectedEdgeDataGraph by specifying V as a DirectedDfsVertex.

Constructor Summary

Constructors

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

Method Summary

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

edgeCount

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

DfsGraph

public DfsGraph()

Initialize graph to a default initial capacity of 16 vertices

DfsGraph

public DfsGraph(int initialCapacity)

Initialize graph to have capacity for the given number of vertices

Parameters:

initialCapacity - expected number of vertices

DfsGraph

public DfsGraph(java.util.Collection<DirectedDfsVertex<E>> 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