boost::graph metric_tsp_approx with bundled properties fails at runtime












0














I am trying to run the metric_tsp_approx algorithm from boost BGL to solve a simple Traveling Salesman Problem (here the documentation and the related example). I use bundled properties to create my graph. The code compiles fine, but at runtime, when executing the function metric_tsp_approx(...), it crashes and gives the assertion vector subscript out of range. I cannot understand what I am missing here, below I put some code that you can run to reproduce the error:



#include <string>

#include <vector>

#include <string>

#include <iostream>



#include <boost/graph/adjacency_matrix.hpp>

#include <boost/graph/metric_tsp_approx.hpp>



using std::cout;

using std::endl;

using std::string;

using std::vector;



using namespace boost;



struct Trip

{

    double km;

    int travel_minutes;

};



struct Location

{

    string name;

    std::pair<double, double> coordinates;

    //the following function returns the euclidian distance between locations

    static double distance(const Location & l1, const Location & l2);

};



typedef boost::adjacency_matrix<boost::undirectedS, Location, Trip> Graph;

typedef typename Graph::vertex_descriptor Node;

typedef typename Graph::edge_descriptor Arc;



int main()

{

    //num of nodes in graph

    int N = 4;



    Graph g = Graph(N);



    //building a complete graph of 4 nodes on a 2x2 grid: coordinates of such nodes are (0,0), (0,1), (1,0), (1,1)

    //the member variable *km* of each arc is computed as the 

    //Euclidian distance between the source and target node



    Graph::vertex_iterator v, v_end;

    for (tie(v, v_end) = vertices(g); v != v_end; ++v)

    {

        Location loc;

        int idx_vertex = N - (int)std::distance(v, v_end);

        loc.name = "loc_" + std::to_string(idx_vertex);

        loc.coordinates.first = idx_vertex < 2 ? 0 : 1;

        loc.coordinates.second = idx_vertex % 2 == 0 ? 0 : 1;

        g[*v] = loc;

    }



    Graph::vertex_iterator i, i_end, j, j_end;

    for (tie(i, i_end) = vertices(g); i != i_end; ++i)

    {

        for (tie(j, j_end) = vertices(g); j != j_end; ++j)

        {

            Trip trip;

            trip.km = Location::distance(g[*i], g[*j]);

            trip.travel_minutes = (int)floor(trip.km);

            Arc a;

            bool inserted;

            tie(a,inserted) = add_edge(*i, *j, g);

            g[a] = trip;

        }

    }



    /*TSP*/



    vector<Node> tour;//solution of TSP

    double len = 0;//length of the tour



    auto vertex_indices = get(vertex_index, g);

    auto w_map = get(&Trip::km, g);//property map of Trip::km that I want to pass to metric_tsp_approx

    auto tour_visitor = make_tsp_tour_len_visitor(g, std::back_inserter(tour), len, w_map);



    //run

    metric_tsp_approx(g, w_map, vertex_indices, tour_visitor);//ERR: vector subscript out of range



    for (vector<Node>::iterator itr = tour.begin(); itr != tour.end(); ++itr)

        cout << g[*itr].name << " ";



    return 0;

}



double Location::distance(const Location & l1, const Location & l2)

{

    double lat_delta = l1.coordinates.first - l2.coordinates.first;

    double lng_delta = l1.coordinates.second - l2.coordinates.second;

    return sqrt(lat_delta*lat_delta + lng_delta*lng_delta);

}





c++ boost runtime-error boost-graph







share|improve this question


















  • 2




    Difference between your code and example is you add edges where source and target vertices are the same, for example (1,1), (2,2) with 0.0 as weight. Without adding such edges your code works.
    – rafix07
    Nov 19 '18 at 20:31












  • Thank you very much rafix07, it indeed solved the problem!
    – Nicola Gastaldon
    Nov 19 '18 at 22:27










  • @rafix07 why not post your valuable comments as answers :)
    – sehe
    Nov 21 '18 at 0:13
















0














I am trying to run the metric_tsp_approx algorithm from boost BGL to solve a simple Traveling Salesman Problem (here the documentation and the related example). I use bundled properties to create my graph. The code compiles fine, but at runtime, when executing the function metric_tsp_approx(...), it crashes and gives the assertion vector subscript out of range. I cannot understand what I am missing here, below I put some code that you can run to reproduce the error:



#include <string>

#include <vector>

#include <string>

#include <iostream>



#include <boost/graph/adjacency_matrix.hpp>

#include <boost/graph/metric_tsp_approx.hpp>



using std::cout;

using std::endl;

using std::string;

using std::vector;



using namespace boost;



struct Trip

{

    double km;

    int travel_minutes;

};



struct Location

{

    string name;

    std::pair<double, double> coordinates;

    //the following function returns the euclidian distance between locations

    static double distance(const Location & l1, const Location & l2);

};



typedef boost::adjacency_matrix<boost::undirectedS, Location, Trip> Graph;

typedef typename Graph::vertex_descriptor Node;

typedef typename Graph::edge_descriptor Arc;



int main()

{

    //num of nodes in graph

    int N = 4;



    Graph g = Graph(N);



    //building a complete graph of 4 nodes on a 2x2 grid: coordinates of such nodes are (0,0), (0,1), (1,0), (1,1)

    //the member variable *km* of each arc is computed as the 

    //Euclidian distance between the source and target node



    Graph::vertex_iterator v, v_end;

    for (tie(v, v_end) = vertices(g); v != v_end; ++v)

    {

        Location loc;

        int idx_vertex = N - (int)std::distance(v, v_end);

        loc.name = "loc_" + std::to_string(idx_vertex);

        loc.coordinates.first = idx_vertex < 2 ? 0 : 1;

        loc.coordinates.second = idx_vertex % 2 == 0 ? 0 : 1;

        g[*v] = loc;

    }



    Graph::vertex_iterator i, i_end, j, j_end;

    for (tie(i, i_end) = vertices(g); i != i_end; ++i)

    {

        for (tie(j, j_end) = vertices(g); j != j_end; ++j)

        {

            Trip trip;

            trip.km = Location::distance(g[*i], g[*j]);

            trip.travel_minutes = (int)floor(trip.km);

            Arc a;

            bool inserted;

            tie(a,inserted) = add_edge(*i, *j, g);

            g[a] = trip;

        }

    }



    /*TSP*/



    vector<Node> tour;//solution of TSP

    double len = 0;//length of the tour



    auto vertex_indices = get(vertex_index, g);

    auto w_map = get(&Trip::km, g);//property map of Trip::km that I want to pass to metric_tsp_approx

    auto tour_visitor = make_tsp_tour_len_visitor(g, std::back_inserter(tour), len, w_map);



    //run

    metric_tsp_approx(g, w_map, vertex_indices, tour_visitor);//ERR: vector subscript out of range



    for (vector<Node>::iterator itr = tour.begin(); itr != tour.end(); ++itr)

        cout << g[*itr].name << " ";



    return 0;

}



double Location::distance(const Location & l1, const Location & l2)

{

    double lat_delta = l1.coordinates.first - l2.coordinates.first;

    double lng_delta = l1.coordinates.second - l2.coordinates.second;

    return sqrt(lat_delta*lat_delta + lng_delta*lng_delta);

}





c++ boost runtime-error boost-graph







share|improve this question


















  • 2




    Difference between your code and example is you add edges where source and target vertices are the same, for example (1,1), (2,2) with 0.0 as weight. Without adding such edges your code works.
    – rafix07
    Nov 19 '18 at 20:31












  • Thank you very much rafix07, it indeed solved the problem!
    – Nicola Gastaldon
    Nov 19 '18 at 22:27










  • @rafix07 why not post your valuable comments as answers :)
    – sehe
    Nov 21 '18 at 0:13














0












0








0







I am trying to run the metric_tsp_approx algorithm from boost BGL to solve a simple Traveling Salesman Problem (here the documentation and the related example). I use bundled properties to create my graph. The code compiles fine, but at runtime, when executing the function metric_tsp_approx(...), it crashes and gives the assertion vector subscript out of range. I cannot understand what I am missing here, below I put some code that you can run to reproduce the error:



#include <string>

#include <vector>

#include <string>

#include <iostream>



#include <boost/graph/adjacency_matrix.hpp>

#include <boost/graph/metric_tsp_approx.hpp>



using std::cout;

using std::endl;

using std::string;

using std::vector;



using namespace boost;



struct Trip

{

    double km;

    int travel_minutes;

};



struct Location

{

    string name;

    std::pair<double, double> coordinates;

    //the following function returns the euclidian distance between locations

    static double distance(const Location & l1, const Location & l2);

};



typedef boost::adjacency_matrix<boost::undirectedS, Location, Trip> Graph;

typedef typename Graph::vertex_descriptor Node;

typedef typename Graph::edge_descriptor Arc;



int main()

{

    //num of nodes in graph

    int N = 4;



    Graph g = Graph(N);



    //building a complete graph of 4 nodes on a 2x2 grid: coordinates of such nodes are (0,0), (0,1), (1,0), (1,1)

    //the member variable *km* of each arc is computed as the 

    //Euclidian distance between the source and target node



    Graph::vertex_iterator v, v_end;

    for (tie(v, v_end) = vertices(g); v != v_end; ++v)

    {

        Location loc;

        int idx_vertex = N - (int)std::distance(v, v_end);

        loc.name = "loc_" + std::to_string(idx_vertex);

        loc.coordinates.first = idx_vertex < 2 ? 0 : 1;

        loc.coordinates.second = idx_vertex % 2 == 0 ? 0 : 1;

        g[*v] = loc;

    }



    Graph::vertex_iterator i, i_end, j, j_end;

    for (tie(i, i_end) = vertices(g); i != i_end; ++i)

    {

        for (tie(j, j_end) = vertices(g); j != j_end; ++j)

        {

            Trip trip;

            trip.km = Location::distance(g[*i], g[*j]);

            trip.travel_minutes = (int)floor(trip.km);

            Arc a;

            bool inserted;

            tie(a,inserted) = add_edge(*i, *j, g);

            g[a] = trip;

        }

    }



    /*TSP*/



    vector<Node> tour;//solution of TSP

    double len = 0;//length of the tour



    auto vertex_indices = get(vertex_index, g);

    auto w_map = get(&Trip::km, g);//property map of Trip::km that I want to pass to metric_tsp_approx

    auto tour_visitor = make_tsp_tour_len_visitor(g, std::back_inserter(tour), len, w_map);



    //run

    metric_tsp_approx(g, w_map, vertex_indices, tour_visitor);//ERR: vector subscript out of range



    for (vector<Node>::iterator itr = tour.begin(); itr != tour.end(); ++itr)

        cout << g[*itr].name << " ";



    return 0;

}



double Location::distance(const Location & l1, const Location & l2)

{

    double lat_delta = l1.coordinates.first - l2.coordinates.first;

    double lng_delta = l1.coordinates.second - l2.coordinates.second;

    return sqrt(lat_delta*lat_delta + lng_delta*lng_delta);

}





c++ boost runtime-error boost-graph







share|improve this question













I am trying to run the metric_tsp_approx algorithm from boost BGL to solve a simple Traveling Salesman Problem (here the documentation and the related example). I use bundled properties to create my graph. The code compiles fine, but at runtime, when executing the function metric_tsp_approx(...), it crashes and gives the assertion vector subscript out of range. I cannot understand what I am missing here, below I put some code that you can run to reproduce the error:



#include <string>

#include <vector>

#include <string>

#include <iostream>



#include <boost/graph/adjacency_matrix.hpp>

#include <boost/graph/metric_tsp_approx.hpp>



using std::cout;

using std::endl;

using std::string;

using std::vector;



using namespace boost;



struct Trip

{

    double km;

    int travel_minutes;

};



struct Location

{

    string name;

    std::pair<double, double> coordinates;

    //the following function returns the euclidian distance between locations

    static double distance(const Location & l1, const Location & l2);

};



typedef boost::adjacency_matrix<boost::undirectedS, Location, Trip> Graph;

typedef typename Graph::vertex_descriptor Node;

typedef typename Graph::edge_descriptor Arc;



int main()

{

    //num of nodes in graph

    int N = 4;



    Graph g = Graph(N);



    //building a complete graph of 4 nodes on a 2x2 grid: coordinates of such nodes are (0,0), (0,1), (1,0), (1,1)

    //the member variable *km* of each arc is computed as the 

    //Euclidian distance between the source and target node



    Graph::vertex_iterator v, v_end;

    for (tie(v, v_end) = vertices(g); v != v_end; ++v)

    {

        Location loc;

        int idx_vertex = N - (int)std::distance(v, v_end);

        loc.name = "loc_" + std::to_string(idx_vertex);

        loc.coordinates.first = idx_vertex < 2 ? 0 : 1;

        loc.coordinates.second = idx_vertex % 2 == 0 ? 0 : 1;

        g[*v] = loc;

    }



    Graph::vertex_iterator i, i_end, j, j_end;

    for (tie(i, i_end) = vertices(g); i != i_end; ++i)

    {

        for (tie(j, j_end) = vertices(g); j != j_end; ++j)

        {

            Trip trip;

            trip.km = Location::distance(g[*i], g[*j]);

            trip.travel_minutes = (int)floor(trip.km);

            Arc a;

            bool inserted;

            tie(a,inserted) = add_edge(*i, *j, g);

            g[a] = trip;

        }

    }



    /*TSP*/



    vector<Node> tour;//solution of TSP

    double len = 0;//length of the tour



    auto vertex_indices = get(vertex_index, g);

    auto w_map = get(&Trip::km, g);//property map of Trip::km that I want to pass to metric_tsp_approx

    auto tour_visitor = make_tsp_tour_len_visitor(g, std::back_inserter(tour), len, w_map);



    //run

    metric_tsp_approx(g, w_map, vertex_indices, tour_visitor);//ERR: vector subscript out of range



    for (vector<Node>::iterator itr = tour.begin(); itr != tour.end(); ++itr)

        cout << g[*itr].name << " ";



    return 0;

}



double Location::distance(const Location & l1, const Location & l2)

{

    double lat_delta = l1.coordinates.first - l2.coordinates.first;

    double lng_delta = l1.coordinates.second - l2.coordinates.second;

    return sqrt(lat_delta*lat_delta + lng_delta*lng_delta);

}





c++ boost runtime-error boost-graph




c++ boost runtime-error boost-graph






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked Nov 19 '18 at 14:11









Nicola Gastaldon

212




212








  • 2




    Difference between your code and example is you add edges where source and target vertices are the same, for example (1,1), (2,2) with 0.0 as weight. Without adding such edges your code works.
    – rafix07
    Nov 19 '18 at 20:31












  • Thank you very much rafix07, it indeed solved the problem!
    – Nicola Gastaldon
    Nov 19 '18 at 22:27










  • @rafix07 why not post your valuable comments as answers :)
    – sehe
    Nov 21 '18 at 0:13














  • 2




    Difference between your code and example is you add edges where source and target vertices are the same, for example (1,1), (2,2) with 0.0 as weight. Without adding such edges your code works.
    – rafix07
    Nov 19 '18 at 20:31












  • Thank you very much rafix07, it indeed solved the problem!
    – Nicola Gastaldon
    Nov 19 '18 at 22:27










  • @rafix07 why not post your valuable comments as answers :)
    – sehe
    Nov 21 '18 at 0:13








2




2




Difference between your code and example is you add edges where source and target vertices are the same, for example (1,1), (2,2) with 0.0 as weight. Without adding such edges your code works.
– rafix07
Nov 19 '18 at 20:31






Difference between your code and example is you add edges where source and target vertices are the same, for example (1,1), (2,2) with 0.0 as weight. Without adding such edges your code works.
– rafix07
Nov 19 '18 at 20:31














Thank you very much rafix07, it indeed solved the problem!
– Nicola Gastaldon
Nov 19 '18 at 22:27




Thank you very much rafix07, it indeed solved the problem!
– Nicola Gastaldon
Nov 19 '18 at 22:27












@rafix07 why not post your valuable comments as answers :)
– sehe
Nov 21 '18 at 0:13




@rafix07 why not post your valuable comments as answers :)
– sehe
Nov 21 '18 at 0:13












0






active

oldest

votes











Your Answer






StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53376465%2fboostgraph-metric-tsp-approx-with-bundled-properties-fails-at-runtime%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Stack Overflow!


  • Please be sure to answer the question. Provide details and share your research!

But avoid …



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • Please be sure to answer the question. Provide details and share your research!

But avoid …



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53376465%2fboostgraph-metric-tsp-approx-with-bundled-properties-fails-at-runtime%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

Image
28 6 $begingroup$ Per the Font of Magic feature, sorcerer can use Flexible Casting to create 5th-level spell slots at level 7, even though they are not typically available until level 9. You can transform unexpended sorcery points into one spell slot as a bonus action on your turn. The Creating Spell Slots table shows the cost of creating a spell slot of [5th level is 7] If such a sorcerer levels up while still having this 5th-level spell slot, can they choose a 5th-level spell as the spell they gain upon levelling up? The Spellcasting feature states: Additionally, when you gain a level in this class, you can choose one of the sorcerer spells you know and replace it with another spell from the sorcerer spell list, which also must be of a level for which you have spell slots.
Read more

Does disintegrating a polymorphed enemy still kill it after the 2018 errata?

Image
up vote 13 down vote favorite 1 After the 2018 errata, the disintegrate spell description now reads: A creature targeted by this spell must make a Dexterity saving throw. On a failed save, the target takes 10d6 + 40 force damage. The target is disintegrated if this damage leaves it with 0 hit points. If you were to polymorph an enemy into a rat and then disintegrate it, would the enemy be disintegrated or would it just return to its original form? I know that for Druids, it’s not an instant kill anymore, but is this the case for polymorph as well? dnd-5e spells polymorph errata share | improve this question edited 18 hours ago
Read more

A Topological Invariant for $pi_3(U(n))$

Image
3 3 $begingroup$ Recently, I saw a construction of topological invariant for $pi_3(U(n))$ with $ngeq 2$ : $$ N=frac{1}{24pi^2}int_{S^3} d^3x epsilon^{ijk} Tr[(U^{-1}partial_{x_i}U)(U^{-1}partial_{x_j}U)(U^{-1}partial_{x_k}U)] , $$ where $Uin U(n)$ depends on $boldsymbol{x}=(x_1,x_2,x_3)in S^3$ , $epsilon^{ijk}$ is the Levi-Civita symbol, $i,j,k=1,2,3$ , and the duplicated indexes are summed over. It is claimed that $N$ is an integer, but why? Update 02/02/2019 I think I got an argument for $n=2$ . In this case, $U=e^{i varphi} q$ with $qin SU(2)$ . Due to the trace and the Levi-Civita symbol in $N$ , $varphi$ does not contribute to $N$ . As $Tr[q^{dagger}partial_i q]=0$ and $(q^{dagger}partial_i q)^{dagger}=-q^{dagger}partial_i q$ , $q^{dagger}partial_i q$ in geneeral has the form $q^{dagger}partia
Read more