All Packages  Class Hierarchy  This Package  Previous  Next  Index

Class tw.edu.ncnu.im.cnclab.Algor.MST_Kruskal 

java.lang.Object
   |
   +----tw.edu.ncnu.im.cnclab.Algor.Algorithm
           |
           +----tw.edu.ncnu.im.cnclab.Algor.MST_Kruskal
public class MST_Kruskal
extends Algorithm
The MST_Kruskal class implements the Minimum spanning tree using the Kruskal algorithm.

Version:
0.4 Jul 8, 1999
Author:
Ding-Yi Chen

Variable Index

o ds
o OTHER
o pq
o TREE_EDGE

Constructor Index

o MST_Kruskal()
Constructor of algorithm Kruskal.

Method Index

o algorImpl()
Implementation of this algorithm.
o setArg(Object[])
Set arguments from the argument list.

Variables

o pq 
 protected PriorityQueue pq
o OTHER 
 public static final Color OTHER
o TREE_EDGE 
 public static final Color TREE_EDGE
o ds 
 protected DisjointSets ds

Constructors

o MST_Kruskal 
 public MST_Kruskal()
Constructor of algorithm Kruskal.

Methods

o setArg 
 protected void setArg(Object args[]) throws IllegalArgumentException
Set arguments from the argument list.

Valid args: null or Object[]{PriorityQueue}

Parameters:
args - The list of arguments.
Throws: IllegalArgumentException
Illegal argument defined.
Overrides:
setArg in class Algorithm
o algorImpl 
 protected Object algorImpl()
Implementation of this algorithm.

Returns:
the processed graph.
Overrides:
algorImpl in class Algorithm 
All Packages  Class Hierarchy  This Package  Previous  Next  Index