GRAFF.E

thoroughness:  faultlessness:

GRAFF.E
Download (37.4K).

This is an engine to the route finder, that takes points, connected to each other by shortcuts and tries to find the shortest path from the starting point to the ending one. The path can involve some intermediate points. The path that looks "straighter" may be actually longer than a circuitous one. And the program must not think forever...

I moved the description of the problem of the route search and the algorithm details to the separate file because it is very formal, long and may be complicated for understanding.

User controls, when entering points:

• arrows — move the cursor;
• Space — place a next point;
• Enter — go to entering shortcuts.

User controls, when entering shortcuts:

• Space — go to next point;
• Tab — remember the current point;
• Esc — connect the current point to the remembered one;
• F1 — mark the starting point;
• F2 — mark the ending point;
• Enter — calculate the shortest route (may take some time).

After calculation completes, press the q key to start over. There is no exit from this program.