PLAY WITH GRAPHS

This is a very simple program to test-drive a new object, TMathGraph, and his Dijkstra-based FindShortestPath method.

You can create nodes, give them names, create edges between two nodes with arbitrary weight.

The purpose of it all is calculating the shortest path between two nodes.

The yellow path is the shortest path between two nodes.

Useless, isn't it? But encapsulating the Dijkstra's algorithm I succesfully solved a problem in another application which kept giving me headaches.