Data structure for graph

Claudia4 / Traveling-Salesman

TSP with Branch-and-Bound algorithm by Held and Karp

0 stars 1 forks source link

Data structure for graph #1

Closed Claudia4 closed 6 years ago

Claudia4 commented 6 years ago

What data structure will we use for the graph and the weights?

Make sure that it is easy to derive G-v1 and c\lambda
How will R and F as subsets of edges be saved? It should be easy to combine with the graph structure.

Claudia4 commented 6 years ago

We decided to put the costs in a 'matrix', that is a vector of vectors.

I decided to use entries of type double, even though the initial costs are rounded to integers. This is because all the c_\lambda will not be integer, so we would have to use double at some point, anyway.

Claudia4 commented 6 years ago

An appropriate structur for edges is still open. Possibilities would be

using std::pair
creating an own struct (containing two ints) or even a class

AnnaA11 commented 6 years ago

I think it is enough to use vectors of pairs for R and F.