karepker / little-tsp Goto Github PK
View Code? Open in Web Editor NEWA C++ implementation of the branch and bound TSP algorithm described by Little et al in their 1963 paper
License: GNU General Public License v3.0
A C++ implementation of the branch and bound TSP algorithm described by Little et al in their 1963 paper
License: GNU General Public License v3.0
I'm having trouble building your project -- g++ is choking on the way you specify constructors:
[ 3%] Building CXX object CMakeFiles/debug_objects.dir/graph/edge.o
In file included from /Users/sam/Builds/little-tsp/src/graph/edge.cpp:1:
/Users/sam/Builds/little-tsp/src/graph/edge.hpp:8:16: error: expected member
name or ';' after declaration specifiers
Edge() : u{-1}, v{-1} {} // use invalid indices as default edge u and v
^
/Users/sam/Builds/little-tsp/src/graph/edge.hpp:8:12: error: expected '('
Edge() : u{-1}, v{-1} {} // use invalid indices as default edge u and v
^
/Users/sam/Builds/little-tsp/src/graph/edge.hpp:8:15: error: expected ';' after
expression
Edge() : u{-1}, v{-1} {} // use invalid indices as default edge u and v
^
;
/Users/sam/Builds/little-tsp/src/graph/edge.hpp:8:13: warning: expression result
unused [-Wunused-value]
Edge() : u{-1}, v{-1} {} // use invalid indices as default edge u and v
^~
1 warning and 3 errors generated.
make[2]: *** [CMakeFiles/debug_objects.dir/graph/edge.o] Error 1
make[1]: *** [CMakeFiles/debug_objects.dir/all] Error 2
make: *** [all] Error 2
It seems that using {} instead of () is invalid. Is there something I'm missing?
Hello, Instead of a map. I would like to use this library to solve directly on the adjacency matrix of the distances. Is it possible?
Hello,
I don't understand the input file's vertex list definition, I see other program using a matrix format , like : (here a symetric case) :
(Distance from 0 to 1 is 1.0, 1 to 2 is 3.0, 0 to 2 is 2.0)
D = [[ 0, 1.0, 2.0],
[ 1.0, 0, 3.0],
[ 2.0, 3.0, 0]]
and i understand this format.
Could you help me to understand your format ?
Regards,
A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.