util.decision

Class PrecomputedMSTCollection

java.lang.Object

util.decision.PrecomputedMSTCollection

All Implemented Interfaces:

java.io.Serializable

public final class PrecomputedMSTCollection
extends java.lang.Object
implements java.io.Serializable

Represents a decision tree that can compute the MST of graphs up to a given size using an optimal number of comparisons.

See Also:

Serialized Form

Method Summary

Modifier and Type	Method and Description
static PrecomputedMSTCollection	computeUpTo(int maxVertices) Computes all optimal mst decision trees for graphs with up to maxVertices vertices
<T,E extends DirectedEdge<T,E> & java.lang.Comparable<? super E>> EdgeList<E>	findMST(int vertices, java.util.List<E> edges)
int	getMaxVertices() Returns the max number of vertices of a graph up to which the optimal mst decision trees have been computed.

Methods inherited from class java.lang.Object

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

Method Detail

getMaxVertices

public int getMaxVertices()

Returns the max number of vertices of a graph up to which the optimal mst decision trees have been computed.

Returns:

the max number of vertices of a graph up to which the optimal mst decision trees have been computed

computeUpTo

public static PrecomputedMSTCollection computeUpTo(int maxVertices)

Computes all optimal mst decision trees for graphs with up to maxVertices vertices

Parameters:

maxVertices - the number of vertices that a graph of which we want to compute the mst in the optimal number of comparisons may have

Returns:

an object of this class that contains all the decision trees

findMST

public <T,E extends DirectedEdge<T,E> & java.lang.Comparable<? super E>> EdgeList<E> findMST(int vertices,
                                                                                             java.util.List<E> edges)