5 lines
286 B
Plaintext
5 lines
286 B
Plaintext
This package(Christofides) provides a way to implement Christofides algorithm
|
|
for solving Travelling Saleman Problem(TSP) to obtain an approximate solution
|
|
on an undirected graph(Distance Matrix) provided as an upper Triangular matrix
|
|
The Distance from a node on to itself is assumed 0
|