Satsuma
a delicious .NET graph library
 All Classes Namespaces Files Functions Variables Enumerations Enumerator Properties Pages
Classes | Namespaces | Enumerations
Tsp.cs File Reference

Go to the source code of this file.

Classes

class  Satsuma.CheapestLinkTsp< TNode >
 Solves the symmetric traveling salesman problem by using the cheapest link heuristic. More...
 
class  Satsuma.HamiltonianCycle
 Attempts to find a (directed) Hamiltonian cycle in a graph using TSP solvers. More...
 
class  Satsuma.InsertionTsp< TNode >
 Solves the traveling salesman problem by using the insertion heuristic. More...
 
interface  Satsuma.ITsp< TNode >
 Interface to TSP solvers. More...
 
class  Satsuma.Opt2Tsp< TNode >
 Improves a solution for the traveling salesman problem by using the 2-OPT method. More...
 
class  Satsuma.TspUtils
 Utilities regarding the traveling salesman problem. More...
 

Namespaces

package  Satsuma
 

Enumerations

enum  Satsuma.TspSelectionRule { Satsuma.Nearest, Satsuma.Farthest }
 The operation mode of InsertionTsp<TNode>. More...