The 5th line from the end is what is causing me problems. It
seemed to work with an adjacency_list. (I'd also would like to add weights, but I guess add_edge could support that...I just think that this way is faster based on the "Quick Tour of the BGL" page in the docs.)
Is the error telling me (from "candidates are...") that it only works with directed graphs? (Sorry for the strange characters...my g++ is printing them out and I don't know why...it looks like I'm using colorgcc in the wrong terminal, but I don't think that's the case.)
----- sample.cpp: In function âint main()â:
sample.cpp:34: error: no matching function for call to âboost::adjacency_matrix<boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, int, boost::no_property>, boost::no_property, std::allocator<bool> >::adjacency_matrix(main()::E [7], main()::E*, int [7], const int&)â
Hmmm... I wonder if the compiler is having trouble telling the difference between edges and edges + num_edges. You might try passing edges as &edges[0] to force the compiler to treat it as a pointer. Maybe? Andrew Sutton andrew.n.sutton@gmail.com