edu.bsu.cs.algorithm
Class Median
java.lang.Object
|
+--edu.bsu.cs.algorithm.Algorithm
|
+--edu.bsu.cs.algorithm.Median
- public class Median
- extends Algorithm
Finds the Median of a given graph. Median M(G) is the subgraph induced by the set of vertices having minimum distance.
Based on Floyd-Warshall Algorithm implemented by Yang and Fred.
- Since:
- 13 May 1999
- Version:
- 31 May 2002
- Author:
- Nicolas Giampaoli
, Elizabeth VandenBerg
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 |
Median
public Median()
Median
public Median(JavaGraph jGraph,
Vector inputs,
Vector animation)
median
protected void median()
median
protected void median(JavaGraph jGraph,
Vector inputs,
Vector animation)
callOwnConstructor
public void callOwnConstructor(JavaGraph jGraph,
Vector inputs,
Vector animation)
- 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:
jGraph
- the edu.bsu.cs.graph.JavaGraph that the algorithm is performed oninputs
- 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
animation
- a Vector that is filled with AnimObjects as the algorithm proceeds. It must be instantiated before this method is called.