###
Frequently Asked Questions

*Why does an edge dissappear after I create it?*

There are two modes in GRAAL, an overall graph viewing mode and a manipulated graph mode. To see all edges (not just those manipulated by a heuristic in blue), press the SPACEBAR to toggle modes.

*What is TSP?*

The Traveling Salesman Problem is a very well known intractable (NP-Complete) problem. The problem is to find the shortest distance to travel in visiting every city on a salesman's route. The problem can
be applied to many industrial applications.

Back to the Graph Algorithms Applet