#include <tsp.h>
Definition at line 54 of file tsp.h.
◆ TSP() [1/2]
TSP::TSP |
( |
string |
in, |
|
|
string |
out |
|
) |
| |
◆ TSP() [2/2]
TSP::TSP |
( |
vector< Eigen::Vector2d > |
nodes, |
|
|
vector< vector< double >> |
weights |
|
) |
| |
◆ ~TSP()
◆ create_tour()
void TSP::create_tour |
( |
int |
pos | ) |
|
◆ euler()
void TSP::euler |
( |
int |
pos, |
|
|
vector< int > & |
path |
|
) |
| |
◆ fillMatrix_threads()
void TSP::fillMatrix_threads |
( |
| ) |
|
◆ find_best_path()
int TSP::find_best_path |
( |
int |
pos | ) |
|
◆ findMST_old()
void TSP::findMST_old |
( |
| ) |
|
◆ findOdds()
◆ get_distance()
double TSP::get_distance |
( |
struct City |
c1, |
|
|
struct City |
c2 |
|
) |
| |
◆ get_size()
◆ getNodeCount()
void TSP::getNodeCount |
( |
| ) |
|
|
private |
◆ make_hamilton()
void TSP::make_hamilton |
( |
vector< int > & |
path, |
|
|
double & |
path_dist |
|
) |
| |
◆ make_shorter()
void TSP::make_shorter |
( |
| ) |
|
◆ minKey()
int TSP::minKey |
( |
double |
key[], |
|
|
bool |
mstSet[] |
|
) |
| |
|
private |
◆ perfect_matching()
void TSP::perfect_matching |
( |
| ) |
|
◆ printAdjList()
void TSP::printAdjList |
( |
| ) |
|
◆ printCities()
void TSP::printCities |
( |
| ) |
|
◆ printEuler()
◆ printPath()
◆ printResult()
void TSP::printResult |
( |
| ) |
|
◆ readCities()
◆ adjlist
vector<int>* TSP::adjlist |
◆ circuit
Definition at line 96 of file tsp.h.
◆ cities
Definition at line 99 of file tsp.h.
◆ cost
Definition at line 76 of file tsp.h.
◆ end_idx
◆ graph
◆ inFname
Definition at line 66 of file tsp.h.
Definition at line 93 of file tsp.h.
◆ odds
Definition at line 72 of file tsp.h.
◆ outFname
Definition at line 69 of file tsp.h.
◆ path_vals
◆ pathLength
◆ start_idx
The documentation for this class was generated from the following files: