This program was created as an exercise in graphs to test-drive the well-known
Dijkstra algorithm.
A TMathGraph class is included, which I successfully reused in another application.

PLAY WITH GRAPHS

In the main panel you can click the left mouse button to create a new node or to select
an existing one. After you have selected a node you can select an edge that is departing
from it.
To create a new edge you have to select a node, position the mouse pointer on another node
and click the right mouse button. Note that you create a directed edge- to create a bidirectional
edge you will have to repeat the operation swapping the nodes.
You may delete the selected node or edge choosing the appropriate menu item on
top.

On the top right panel data about the selected node and edge is shown - you can modify it.
To find the shortest path between two nodes you have to select a node, choose the Find
Shortest Path menu item, and click on the node you want to find a path into.

You can load/save graphs.

Diego Amicabile
[email protected]
http://www.geocities.com/diegoami

--------------

COMPILING

You will need Delphi 3 & spider classes from INTERVAL Software (not included)
available at

http://www.intervalsoftware.com/spiderclasses.html

You are viewing proxied material from ftp.icm.edu.pl. The copyright of proxied material belongs to its original authors. Any comments or complaints in relation to proxied material should be directed to the original authors of the content concerned. Please see the disclaimer for more details.