Class TravellingSalesman<T, W>
Uses dynamic programming for a psuedo-polynomial time runTime complexity for this NP hard problem.
Inherited Members
Namespace: Advanced.Algorithms.Graph
Assembly: Advanced.Algorithms.dll
Syntax
public class TravellingSalesman<T, W>
where W : IComparable
Type Parameters
| Name | Description |
|---|---|
| T | |
| W |
Methods
FindMinWeight(IGraph<T>, IShortestPathOperators<W>)
Declaration
public W FindMinWeight(IGraph<T> graph, IShortestPathOperators<W> operator)
Parameters
| Type | Name | Description |
|---|---|---|
| IGraph<T> | graph | |
| IShortestPathOperators<W> | operator |
Returns
| Type | Description |
|---|---|
| W |