com.codemelon.graph.graph

Class KruskalGraph<E extends SpanningTreeEdgeData>

java.lang.Object

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

com.codemelon.graph.graph.UndirectedEdgeDataGraph<E,V>

com.codemelon.graph.graph.UndirectedWeightedEdgeGraph<E,UndirectedKruskalVertex<E>>

com.codemelon.graph.graph.KruskalGraph<E>

All Implemented Interfaces:

WeightedEdgeGraph

public class KruskalGraph<E extends SpanningTreeEdgeData>
extends UndirectedWeightedEdgeGraph<E,UndirectedKruskalVertex<E>>

Utility class that eliminates a type parameter from UndirectedWeightedEdgeGraph by specifying V as an UndirectedKruskalVertex.

Field Summary

Fields inherited from interface com.codemelon.graph.graph.WeightedEdgeGraph

DEFAULT_WEIGHT_EPSILON

Constructor Summary

Constructors

Constructor and Description
KruskalGraph() Initialize graph to a default initial capacity of 16 vertices
KruskalGraph(java.util.Collection<UndirectedKruskalVertex<E>> vertices) Use the vertices in a collection as the initial vertices in the graph
KruskalGraph(java.util.Collection<UndirectedKruskalVertex<E>> vertices, double weightEpsilon) Use the vertices in a collection as the initial vertices in the graph and set weight epsilon to the specified value.
KruskalGraph(double weightEpsilon) Initialize an empty graph using the given value for weightEpsilon and default initial capacity.
KruskalGraph(int initialCapacity) Initialize graph to have capacity for the given number of vertices
KruskalGraph(int initialCapacity, double weightEpsilon) Initialize an empty graph to have capacity for the given number of vertices and the specified weight epsilon.

Method Summary

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

areEqualWeights, getWeightedEdges, getWeightEpsilon

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

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

KruskalGraph

public KruskalGraph(java.util.Collection<UndirectedKruskalVertex<E>> vertices,
            double weightEpsilon)

Use the vertices in a collection as the initial vertices in the graph and set weight epsilon to the specified value.

Parameters:

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

weightEpsilon - weight epsilon to be used to determine weight equality in this graph

KruskalGraph

public KruskalGraph(double weightEpsilon)

Initialize an empty graph using the given value for weightEpsilon and default initial capacity. The input value must be greater than 0.

Parameters:

weightEpsilon - weight epsilon to be used to determine weight equality in this graph

KruskalGraph

public KruskalGraph(int initialCapacity,
            double weightEpsilon)

Initialize an empty graph to have capacity for the given number of vertices and the specified weight epsilon.

Parameters:

initialCapacity - expected number of vertices in the graph

weightEpsilon - weight epsilon to be used to determine weight equality in this graph

KruskalGraph

public KruskalGraph()

Initialize graph to a default initial capacity of 16 vertices

KruskalGraph

public KruskalGraph(java.util.Collection<UndirectedKruskalVertex<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

KruskalGraph

public KruskalGraph(int initialCapacity)

Initialize graph to have capacity for the given number of vertices

Parameters:

initialCapacity - expected number of vertices