RT#57838 all pairs shortest paths exception

[duffee]

Wed, 26 May 2010 09:11:22 +0800

From: | Cliff Chow cliffchow@hku.hk

Dear Sir,

Thank you David Burdick so much for developing a wonderful module
Boost::Graph which is very much to me for conducting the research on
Social Network Analysis. Most the function calls are working fine
exclude the "all_pairs_shortest_paths_floyd_warshall()", and
"all_pairs_shortest_paths_johnson()" under some conditions vertex.

When I am doing the add_edges() function random vertex/link, sometimes
"all_pairs_shortest_paths_floyd_warshall()", and
"all_pairs_shortest_paths_johnson()" are able to work fine, but
sometimes not.

Herewith the Assertion message when Aborted:
perl: ../include/boost/pending/relaxed_heap.hpp:520: void
boost::relaxed_heap<IndexedType, Compare,
ID>::active_sibling_transform(boost::relaxed_heap<IndexedType, Compare,
ID>::group*, boost::relaxed_heap<IndexedType, Compare, ID>::group*)
[with IndexedType = unsigned int, Compare =
boost::indirect_cmp<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS,
boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t,
double, boost::no_property>, boost::property<boost::edge_weight_t,
double, boost::property<boost::edge_weight2_t, double,
boost::no_property> >, boost::no_property, boost::listS>,
boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS,
boost::property<boost::vertex_distance_t, double, boost::no_property>,
boost::property<boost::edge_weight_t, double,
boost::property<boost::edge_weight2_t, double, boost::no_property> >,
boost::no_property, boost::listS>*, double, double&,
boost::vertex_distance_t>, std::less >, ID =
boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t,
double, boost::no_property>, unsigned int>]: Assertion `g->children[r+2]
== p' failed.

Thanks,
Cliff Chow
Computer Science
University of Hong Kong