The greedy algorithm
The greedy algorithm - Double applet
: Active points
: Added edge
: A shortest path between 2 active points
: The longest of the shortest paths.
: Length of path/euclidian distance.
Twin graph areas makes it possible to experiment with different values of t on the same set of points. Points plottet in one graph area automatically appear i both areas, kepping the two sets alike.
, Longest Shortest Path, button highlights the path (or one of the paths) making up the stretch factor.
Copyright 2005 Anja W-L, Nicolai M.A & Sune H