y.layout.planar
Class IntDSP

java.lang.Object
  y.layout.planar.IntDSP

public class IntDSP
extends java.lang.Object

An implementation of the Dijkstra Shortest Path Algorithm for weighted graphs. This algorithm can't handle negative edge weights.

Constructor Summary

IntDSP()

Method Summary

void	dispose()
void	init(Graph _graph)
EdgeList	start(Node start, Node end, DataProvider weightData)

Methods inherited from class java.lang.Object

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

Constructor Detail

IntDSP

public IntDSP()

Method Detail

init

public void init(Graph _graph)

dispose

public void dispose()

start

public EdgeList start(Node start,
                      Node end,
                      DataProvider weightData)