gishur.graph.algorithms
Class Dijkstra
java.lang.Object
|
+--gishur.core.algorithms.Algorithm
|
+--gishur.graph.algorithms.Dijkstra
- public class Dijkstra
- extends Algorithm
Description of Dijkstra Algorithm ...
- Version:
- 1.0
- Author:
- Simon Weidmann
Constructor Summary |
Dijkstra()
Empty (and only) constructor. |
Methods inherited from class gishur.core.algorithms.Algorithm |
execute, execute, execute, execute, execute, execute, execute, execute, getMethod, getParameter, getParameters, getReturnValue, setMethod, setParameter, setParameters |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Dijkstra
public Dijkstra()
- Empty (and only) constructor. All algorithm parameters must be given by calling the
appropriate
dsp
-method.
dsp
public void dsp(Graph g,
Node start,
java.lang.String propertyID)
- Parameters:
g
- the Graph
on which to perform the algorithmstart
- the starting Node
for the algorithmpropertyID
- the ID-String
identifying the properties
which are assigned to g
(or its components) as algorithm
results
dsp
public void dsp(Graph g,
Node start,
Tracer tracer)
- This method can be handed a
Tracer
to record the algorithm steps. If
one calls dsp with tracer!=null
, it will be possible to replay
the algorithm step by step afterwards to examine its way of work.
- Parameters:
g
- the Graph
on which to perform the algorithmstart
- the starting Node
for the algorithmtracer
- the Tracer
which records the algorithm step by step
dsp
public void dsp(Graph g,
Node start,
Tracer tracer,
java.lang.String propertyID)
- Parameters:
g
- the Graph
on which to perform the algorithmstart
- the starting Node
for the algorithmtracer
- the Tracer
which records the algorithm step by steppropertyID
- the key-prefix under which the results will be stored in
g
's properties