The Heuristics menu offers the following commands:
| Greedy | Compute a greedy tour. |
| Boruvka | Compute a Boruvka tour. |
| Quick Boruvka | Compute a Quick Boruvka tour. |
| Nearest Neighbor | Compute a nearest neighbor tour. |
| Random | Compute a random tour. |
| Lin Kernighan | Compute a LinKernighan tour |
All tour commands replace the current graph's edges with the tour edges they compute and print information about the computed edge set to the Ouput pane.
The algorithms use the current edge norm to compute the distance between two nodes, see Set Edge Norm.