[Home] [Puzzles & Projects] [Delphi Techniques] [Math topics] [Library] [Utilities]
|
|
Addendum October28, 2005: The source for this program was repackaged today, moving UTGraphSearch, the unit that contains the graph list and search class, to a common DFF library file. The purpose is to reduce the number of programs to be reposted when a widely used class or routine is fixed or enhanced. The result is that a one time download of the DFF library file is required if you wish to recompile the program.
March 3, 2016: The original demo calculated the shortest
path from Node 1 to node 10 using random weights (distances) from node to node.
The search was one way but a programmer recently modified the program to search
from node 2 to node 10 and reported a bug when the shortest path happened
to be 2-1-3-7-10 which required traveling backwards through node 1. Version
2.0 posted today incorporates two-way searching and allows users to specify
both the start node and the goal node. Running/Exploring the Program
|
[Feedback] [Newsletters (subscribe/view)] [About me]Copyright © 2000-2018, Gary Darby All rights reserved. |