com.codemelon.graph.graph

Class DirectedEdgeDataGraph<T,V extends DirectedEdgeDataVertex<T>>

java.lang.Object

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

com.codemelon.graph.graph.DirectedEdgeDataGraph<T,V>

Direct Known Subclasses:

DfsGraph, DirectedWeightedEdgeGraph

public class DirectedEdgeDataGraph<T,V extends DirectedEdgeDataVertex<T>>
extends AbstractGraph<V>

Directed graph that supports edge data. The type parameter T is the type of the edge data object, U provides a factory method for creating objects, and V is a vertex type supporting edge data of type T.

Constructor Summary

Constructors

Constructor and Description
DirectedEdgeDataGraph() Initialize graph to a default initial capacity of 16 vertices
DirectedEdgeDataGraph(java.util.Collection<V> vertices) Use the vertices in a collection as the initial vertices in the graph
DirectedEdgeDataGraph(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

DirectedEdgeDataGraph

public DirectedEdgeDataGraph()

Initialize graph to a default initial capacity of 16 vertices

DirectedEdgeDataGraph

public DirectedEdgeDataGraph(int initialCapacity)

Initialize graph to have capacity for the given number of vertices

Parameters:

initialCapacity - expected number of vertices

DirectedEdgeDataGraph

public DirectedEdgeDataGraph(java.util.Collection<V> 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 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<V extends DirectedEdgeDataVertex<T>>

Returns:

the number of edges in the graph