All Packages  Class Hierarchy  This Package  Previous  Next  Index

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

java.lang.Object
   |
   +----tw.edu.ncnu.im.cnclab.Algor.Algorithm
           |
           +----tw.edu.ncnu.im.cnclab.Algor.ShortestPath
                   |
                   +----tw.edu.ncnu.im.cnclab.Algor.ShortestPath_Dijkstra
public class ShortestPath_Dijkstra
extends ShortestPath
The abstract ShortestPath_BellmanFord class implements the Shortest path by using Dijkstra algorithm.

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

Variable Index

o pq

Constructor Index

o ShortestPath_Dijkstra()
Constructor of algorithm dijkstra.

Method Index

o algorImpl()
Algorithm implement here.
o getPreferredDialog(Graph, Frame)
Preferred dialog: AskVertexDialog.
o setArg(Object[])
Set arguments from the argument list.

Variables

o pq 
 protected PriorityQueue pq

Constructors

o ShortestPath_Dijkstra 
 public ShortestPath_Dijkstra()
Constructor of algorithm dijkstra.

Methods

o getPreferredDialog 
 public GenericDialog getPreferredDialog(Graph graph,
                                         Frame fr)
Preferred dialog: AskVertexDialog.

Parameters:
graph - The Graph.
fr - The parent Frame.
Returns:
the preferred dialog.
Overrides:
getPreferredDialog in class ShortestPath
o setArg 
 protected void setArg(Object args[]) throws IllegalArgumentException
Set arguments from the argument list.

Valid args: null , Object[]{Integer(int startNode)} or Object[]{Integer(int startNode),PriorityQueue}

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

Returns:
the result of the algorithm.
Throws: AlgorithmException
Exception that throws by algorithm.
Overrides:
algorImpl in class ShortestPath 
All Packages  Class Hierarchy  This Package  Previous  Next  Index