edu.bsu.cs.algorithm
Class Prim

java.lang.Object
  |
  +--edu.bsu.cs.algorithm.Algorithm
        |
        +--edu.bsu.cs.algorithm.Prim

public class Prim

extends Algorithm

Finds a minimum spanning tree using Prim's Algorithm.

Since:

4 Jul 1998

Version:

31 Mar 1999

Author:

Aaron Nall

Constructor Summary

Prim()

Method Summary

void	callOwnConstructor(JavaGraph graph, Vector inputs, Vector animationVector) This method is called by Jedit for any algorithm it executes and must be used in any working algorithm.

Methods inherited from class edu.bsu.cs.algorithm.Algorithm

getCode, getDescription, getName, getType, setCode, setDescription, setFromResources, setName, setType, succeeded, succeeded

Methods inherited from class java.lang.Object

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

Constructor Detail

Prim

public Prim()

Method Detail

callOwnConstructor

public void callOwnConstructor(JavaGraph graph,
                               Vector inputs,
                               Vector animationVector)

Description copied from class: Algorithm

This method is called by Jedit for any algorithm it executes and must be used in any working algorithm.

Specified by:

callOwnConstructor in class Algorithm

Parameters:

graph - the edu.bsu.cs.graph.JavaGraph that the algorithm is performed on

inputs - a Vector of inputs that consists of

• An Integer, if the algorithm uses a single vertex as a starting point
• Two Integers if the algorithm uses two vertices as starting points
• A String if the algorithm starts off of typed input
• Nothing if the algorithm runs automatically on a graph

animationVector - a Vector that is filled with AnimObjects as the algorithm proceeds. It must be instantiated before this method is called.