May 2007 - Boost-users - lists.preview.boost.org

[1.33.1][test][vc80] new user question concerning 1_33_1\libs\test\doc\examples\unit_test_example1.html & unit_test_example1.cpp/
by John McMahon 02 May '07

02 May '07

Hi, I've built and run this with libboost_unit_test_framework-vc80-mt-gd-1_33_1.lib in my Linker->Input->Additional Dependencies. The single test looks like this: void free_test_function() { // reports 'error in "free_test_function": test 2 == 1 failed' BOOST_CHECK(2 == 1); // non-critical test => continue after failure int* p = (int*)0; *p = 0; } When I run it, I see the falied message (2!=1), but I don't get the final 'No errors found' message since '*p=0' causes an unhandlled exception. But when I run it with #include <boost/test/included/unit_test_framework.hpp> and no library instead, it runs to completion as expected. Any idea what I'm doing wrong. thanks in advance, John McMahon

3 9

BGL python bindings: write_graphviz never returns
by John Reid 02 May '07

02 May '07

Hi, I've recently run into a problem where I build a boost.graph in python and then call write_graphviz() which never returns. I haven't managed to generate a reproducible test case yet. All I can say is that the problem disappears if I remove all the edge and vertex properties. Has any one seen anything like this before? When I manage to make a small test case I shall post it. Best, John.

1 0

[serialisation] Yet another problem with non default constructors
by Loïc Joly 02 May '07

02 May '07

I know from the doc that the way to deal with non default constuctors for deserialization is the load_construct_data function. However, I'm in a case where the parameters of the non default constructor are not serializable, but can be provided at runtime. How can I pass those values to load_construct_data ? One example to be clearer: class Data { public: Data(Mutex &m) : myMutex (m) {} private: friend class boost::serialization::access; Mutex &myMutex; // Mutex is intrinsically a non serializable info template<class Archive> void serialize(Archive &ar, const unsigned int file_version){ } }; int main() { vector<Data> v; Mutex mutexForData = createMutex(); std::ifstream ifs("filename", std::ios::binary); boost::archive::text_iarchive ia(ifs); ia >> v; // I'd like Data in the vector to use my mutexForData mutex }

1 0

Serialize map/vector for VC7.0
by Ng Pan 02 May '07

02 May '07

Dear all I am using vc7.0 and learning how to use Boost.Serialization. I face to a problem about serializing the member std::vector<int *> m_vpInt; let me state more. vc7.0 can support rtti, so I use no_rtti. I found an example to use no_rtti (test_no_rtti.cpp). std::vector<std::string> m_vsStr; std::vector<polymorphic_derived1 *> m_vpD1; Both m_vsStr and m_vpD1 can be serialized, but m_vpInt can't what should I do to serialize the member, m_vpInt? I found from the web serialization document : http://www.boost.org/libs/serialization/doc/index.html Is it related to my modification, especially the following last point ? Visual C++ 7.0 * The "pimpl" demo fails to link. Cause and workaround for this is unknown * XML serialization only works with version 1.6x of spirit. In order to build and use this library with this compiler, one must use version 1.6x rather than the latest version shipped with boost. See Release Notes. * This compiler does not support partial template specialization. The implementation of the new shared_ptr serialization depends upon compiler support for partial template specialization. This compiler doesn't implement this feature. In order to serialize shared_ptr<A>, invoke the macro BOOST_SERIALIZATION_SHARED_PTR(A) in the header code. * Lack of support for partial template specialization also creates problems for serialization of std::map. In order to serialize instances of this type include the invocation of BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION for the key type of the map. Best Regards Barr Ng _________________________________________________________________ No masks required! Use MSN Messenger to chat with friends and family. http://go.msnserver.com/HK/25382.asp

1 0

[xpressive] wchar_t and Unicode troubles.
by Eoin 01 May '07

01 May '07

Hello, I've been playing around with Xpressive and have hit a stumbling block when working with Unicode. I really am not sure if what I am trying to do is possible and that I'm just doing something silly wrong. Here is a very small example- wstring in = L"A ЏиϊсoδΣ Hello //World"; wsregex comments = wsregex::compile(L"(//[^\\n]*|/\\*.*?\\*/)"); wstring clear(L""); wstring out = regex_replace(in, comments, clear); (Note if the wstring 'in' gets scrambled in email I have attached a tiny UTF-8 encoded file of what it should contain.) This code compiles but after executing the wstring 'out' only contains "A ". If there are no Unicode characters in 'in' then the regex replacement works as expected. Kind regards, Eóin. "A ЏиϊсoδΣ Hello //World"

3 2

[Attention] Boost sandbox is moving to Subversion
by Doug Gregor 01 May '07

01 May '07

Boost is moving from SourceForge CVS to Subversion, hosted by the Open Systems Laboratory at Indiana University. This process will occur in stages, and will not be complete until after Boost 1.34.0 has been released. On Thursday, May 3rd at 9:00am EDT, the Boost Sandbox will move from its current location in SourceForge CVS into the Boost Subversion repository. The conversion should take less than 8 hours, and I will post a note to the Boost developers and users lists as soon as the sandbox is available under Subversion. If you have any outstanding changes to the sandbox, please commit them to CVS before 9:00am EDT on Thursday, May 3rd. Changes to the sandbox CVS at SourceForge after this time *will not* be reflected in the Subversion repository. Information about the Boost Subversion repository is available at http://svn.boost.org, including information about the Subversion layout and how to get write access to the Subversion repository. The sandbox itself will live at: http(s)://svn.boost.org/svn/boost/sandbox For more information about the migration to Subversion, see http:// svn.boost.org/trac/boost/wiki/MigrationToSubversion. - Doug

1 0

[multi_index] 2D/3D range seaching
by Chris Fairles 01 May '07

01 May '07

At first glance, it looked like the multi_index lib (perhaps combined with the range lib) might provide a convenient way to search for ranges of two+ indicies. For example, points. You have a grid of random points and you want a pair of iterators that contain all points within the cube (x1,y1,z1) and (x2,y2,z2) . I made a multi_index container with a composite key containing all three coords contained within a point class. struct point { int x, y ,z; }; struct coords_key : composite_key< point, member<point,int,x>, member<point,int,y>, member<point,int,z> >{}; struct coords{}; typedef multi_index_container< point, indexed_by< ordered_non_unique<tag<coords>, coords_key> > > point_set; int main() { point_set p; p.insert(point(1,2,2)); p.insert(point(2,3,1)); p.insert(point(1,2,3)); p.insert(point(10,3,2)); point_set::iterator it = p.lower_bound(make_tuple(1,1,1)); point_set::iterator it2 = p.upper_bound(make_tuple(3,3,3)); return 0; } it would be great if [it, it2] contained the first four points, but this is not the case. If I run this code, it == it2 == the first point. Am i barking up the wrong tree? Or is this doable. Cheers, Chris

2 3

[boost-users] [multi_index] print object data member in gdb
by Jeffrey Chang 01 May '07

01 May '07

Hi, I've been compiling & using multi_index without problem for a while; but when I use gdb to print multi_index_container objects, I couldn't find a way to easily traverse through its internal data structure. Here' s my multi_index_container object declaration: class MyClass { .... //define a multi_index_container with a list-like index and an ordered index struct SEQ {}; // Sequence struct TID {}; // TypeID typedef boost::multi_index::multi_index_container< HtvValueBasePtr, // element type boost::multi_index::indexed_by< boost::multi_index::sequenced< // list-like index boost::multi_index::tag<SEQ> >, // sequenced<> boost::multi_index::ordered_unique< // map-lik index boost::multi_index::tag<TID>, boost::multi_index::const_mem_fun< // key extractor HtvValueBase, // class name const HtvTypeBase::TypeID, // return type &HtvValueBase::getTypeId // const mem fun name > // const_mem_fun<> > // ordered_unique<> > // indexed_by<> > TLVListMapType; typedef TLVListMapType::index<SEQ>::type TLV_by_SEQ; typedef TLVListMapType::index<TID>::type TLV_by_TID; TLVListMapType mTLVs; //< indexed on both physical layout & TypeID. .... }; // class MyClass The program is running fine without problem; and I wanna use gdb to check its runtime status by printing out the object. Here's the gdb output when I print the object (I've manully indexed the gdb output & add '//' comment after closing-bracket '{' s.t. it's easier for the eyes): (gdb) p pMyClassObj->mTLVs $5 = { <boost::base_from_member<std::allocator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::shared_ptr<hipeer::HtvValueBase> > > > >,0>> = { member = { <__gnu_cxx::new_allocator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::shared_ptr<hipeer::HtvValueBase> > > > >> = { <No data fields> }, <No data fields> } }, <boost::multi_index::detail::header_holder<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::shared_ptr<hipeer::HtvValueBase> > > >,boost::multi_index::multi_index_container<boost::shared_ptr<hipeer::HtvValueBase>, boost::multi_index::indexed_by<boost::multi_index::sequenced<boost::multi_index::tag<hipeer::HipPacket::SEQ, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na> >, boost::multi_index::ordered_unique<boost::multi_index::tag<hipeer::HipPacket::TID, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::multi_index::const_mem_fun<hipeer::HtvValueBase, const hipeer::HtvTypeBase::TypeID, &hipeer::HtvValueBase::getTypeId>, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<boost::shared_ptr<hipeer::HtvValueBase> > > >> = { <boost::base_from_member<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::shared_ptr<hipeer::HtvValueBase> > > >*,0>> = { member = 0x85cf7a8 }, <boost::noncopyable_::noncopyable> = { <No data fields> }, <No data fields> }, // header_holder <boost::multi_index::detail::sequenced_index<boost::multi_index::detail::nth_layer<1, boost::shared_ptr<hipeer::HtvValueBase>, boost::multi_index::indexed_by<boost::multi_index::sequenced<boost::multi_index::tag<hipeer::HipPacket::SEQ, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na> >, boost::multi_index::ordered_unique<boost::multi_index::tag<hipeer::HipPacket::TID, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::multi_index::const_mem_fun<hipeer::HtvValueBase, const hipeer::HtvTypeBase::TypeID, &hipeer::HtvValueBase::getTypeId>, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<boost::shared_ptr<hipeer::HtvValueBase> > >,boost::mpl::v_item<hipeer::HipPacket::SEQ, boost::mpl::vector0<mpl_::na>, 0> >> = { <boost::multi_index::detail::ordered_index<boost::multi_index::const_mem_fun<hipeer::HtvValueBase, const hipeer::HtvTypeBase::TypeID, &hipeer::HtvValueBase::getTypeId>,std::less<const hipeer::HtvTypeBase::TypeID>,boost::multi_index::detail::nth_layer<2, boost::shared_ptr<hipeer::HtvValueBase>, boost::multi_index::indexed_by<boost::multi_index::sequenced<boost::multi_index::tag<hipeer::HipPacket::SEQ, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na> >, boost::multi_index::ordered_unique<boost::multi_index::tag<hipeer::HipPacket::TID, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::multi_index::const_mem_fun<hipeer::HtvValueBase, const hipeer::HtvTypeBase::TypeID, &hipeer::HtvValueBase::getTypeId>, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<boost::shared_ptr<hipeer::HtvValueBase> > >,boost::mpl::v_item<hipeer::HipPacket::TID, boost::mpl::vector0<mpl_::na>, 0>,boost::multi_index::detail::ordered_unique_tag>> = { <boost::multi_index::detail::index_base<boost::shared_ptr<hipeer::HtvValueBase>,boost::multi_index::indexed_by<boost::multi_index::sequenced<boost::multi_index::tag<hipeer::HipPacket::SEQ, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na> >, boost::multi_index::ordered_unique<boost::multi_index::tag<hipeer::HipPacket::TID, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::multi_index::const_mem_fun<hipeer::HtvValueBase, const hipeer::HtvTypeBase::TypeID, &hipeer::HtvValueBase::getTypeId>, mpl_::na>, mpl_---Type <return> to continue, or q <return> to quit--- ::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>,std::allocator<boost::shared_ptr<hipeer::HtvValueBase> > >> = { <No data fields> }, // index_base <boost::multi_index::detail::safe_container<boost::multi_index::detail::ordered_index<boost::multi_index::const_mem_fun<hipeer::HtvValueBase, const hipeer::HtvTypeBase::TypeID, &hipeer::HtvValueBase::getTypeId>, std::less<const hipeer::HtvTypeBase::TypeID>, boost::multi_index::detail::nth_layer<2, boost::shared_ptr<hipeer::HtvValueBase>, boost::multi_index::indexed_by<boost::multi_index::sequenced<boost::multi_index::tag<hipeer::HipPacket::SEQ, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na> >, boost::multi_index::ordered_unique<boost::multi_index::tag<hipeer::HipPacket::TID, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::multi_index::const_mem_fun<hipeer::HtvValueBase, const hipeer::HtvTypeBase::TypeID, &hipeer::HtvValueBase::getTypeId>, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<boost::shared_ptr<hipeer::HtvValueBase> > >, boost::mpl::v_item<hipeer::HipPacket::TID, boost::mpl::vector0<mpl_::na>, 0>, boost::multi_index::detail::ordered_unique_tag> >> = { <boost::multi_index::detail::safe_container_base> = { <boost::noncopyable_::noncopyable> = { <No data fields> }, header = { cont = 0x0, next = 0x0, unchecked_ = false }, mutex = { m_ = { __m_reserved = 0, __m_count = 0, __m_owner = 0x0, __m_kind = 0, __m_lock = { __status = 0, __spinlock = 0 } } } }, <No data fields> }, // safe_container (for ordered_index?) key = { <No data fields> }, comp = { <> = { <No data fields> }, <No data fields> } }, // ordered_index <boost::multi_index::detail::safe_container<boost::multi_index::detail::sequenced_index<boost::multi_index::detail::nth_layer<1, boost::shared_ptr<hipeer::HtvValueBase>, boost::multi_index::indexed_by<boost::multi_index::sequenced<boost::multi_index::tag<hipeer::HipPacket::SEQ, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na> >, boost::multi_index::ordered_unique<boost::multi_index::tag<hipeer::HipPacket::TID, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::multi_index::const_mem_fun<hipeer::HtvValueBase, const hipeer::HtvTypeBase::TypeID, &hipeer::HtvValueBase::getTypeId>, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<boost::shared_ptr<hipeer::HtvValueBase> > >, boost::mpl::v_item<hipeer::HipPacket::SEQ, boost::mpl::vector0<mpl_::na>, 0> > >> = { <boost::multi_index::detail::safe_container_base> = { <boost::noncopyable_::noncopyable> = { <No data fields> }, header = { cont = 0x0, next = 0x0, unchecked_ = false }, mutex = { m_ = { __m_reserved = 0, __m_count = 0, __m_owner = 0x0, __m_kind = 0, __m_lock = { __status = 0, __spinlock = 0 } } } }, <No data fields> }, // safe_container (for sequenced_index?) <No data fields> }, // sequenced_index node_count = 3 } // $5... (gdb) p pMyClassObj->mTLVs.header $12 = {cont = 0x0, next = 0x0, unchecked_ = false} (gdb) p pMyClassObj->mTLVs.member $13 = {<__gnu_cxx::new_allocator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::shared_ptr<hipeer::HtvValueBase> > > > >> = {<No data fields>}, <No data fields>} (gdb) p rqInbPkt.px->mTLVs.node_count $14 = 3 According to the 'node_count', there're 3 objects stored in the multi_index_container of '*pMyClassObj'. But I couldn't find a way to traverse all 3 objects in gdb: I see there're two 'member' data fields inside MyClass container, the first one doesn't contain any data, while the second one (at address 0x85cf7a8 inside the header_holder class???) seems to be the right place to start traversing... but I don't know if there's any convenient way to traverse it at the symbolic level via container's data members. Any hint? Thanks, --- Jeffrey

2 1

[Shared_ptrs] As I doing this right
by Hughes, James 01 May '07

01 May '07

Although I have been using shared_ptr's for a while, I still get a bit confused with polymorphic stuff ...no change there. An pseudocode example: Class A { }; Class B : public A { DoStuff1(); DoStuff2(); DoStuff3(); DoStuff4() }; // MyFunction handles A and classes derived from A MyFunction(shared_ptr<A>) { }; Main() { shared_ptr<A> poly<new B); // OK so far MyFunction(poly); // Still OK - // OK, done this, but now if I want to call a load of stuff in an instance of B // I either have to make a load of pointer casts (because poly is an A) dynamic_pointer_cast(poly)->DoStuff1(); dynamic_pointer_cast(poly)->DoStuff2(); dynamic_pointer_cast(poly)->DoStuff3(); dynamic_pointer_cast(poly)->DoStuff4(); // Or this? shared_ptr tmp = dynamic_pointer_cast(poly); // is this right? // I have to create a new pointer? tmp->DoStuff1(); tmp->DoStuff2(); tmp->DoStuff3(); tmp->DoStuff4(); } So, the quesiton is one of efficiency - if I was using pointers, I would just new a B and assign to a B* variable, then pass in to the function which would use it as an A - no temp required. With above a new tmp pointer seems to be required - am I right or have I missed something blindingly obvious. James This message (including any attachments) contains confidential and/or proprietary information intended only for the addressee. Any unauthorized disclosure, copying, distribution or reliance on the contents of this information is strictly prohibited and may constitute a violation of law. If you are not the intended recipient, please notify the sender immediately by responding to this e-mail, and delete the message from your system. If you have any questions about this e-mail please notify the sender immediately.

3 3

BGL python: dijkstra_shortest_paths
by John Reid 01 May '07

01 May '07

Hi, I can't seem to use dijkstra_shortest_paths as I think I should via the python bindings. It works fine when I pass a weight_map and predecessor_map. What I want to do is to pass a predecessor_map and a distance_map. Unfortunately boost.python can't convert the arguments. I'm using a bgl that says bgl.__version__ = '1.0' although I haven't updated it from SVN recently. This works: import boost.graph as bgl graph = bgl.Graph() a = graph.add_vertex() b = graph.add_vertex() e = graph.add_edge(a, b) weights = graph.add_edge_property('integer') weights[e] = 5 predecessors = graph.add_vertex_property('vertex') bgl.dijkstra_shortest_paths( graph, a, predecessor_map = predecessors, weight_map = weights ) This doesn't work: import boost.graph as bgl graph = bgl.Graph() a = graph.add_vertex() b = graph.add_vertex() e = graph.add_edge(a, b) distances = graph.add_edge_property('float') predecessors = graph.add_vertex_property('vertex') bgl.dijkstra_shortest_paths( graph, a, predecessor_map = predecessors, distance_map = distances ) This is the error I get: <class 'Boost.Python.ArgumentError'>: Python argument types in boost.graph._graph.dijkstra_shortest_paths(Graph, Vertex) did not match C++ signature: dijkstra_shortest_paths(class boost::graph::python::basic_graph<struct boost ::bidirectionalS> graph, struct boost::graph::python::basic_descriptor<void *,st ruct boost::bidirectionalS> root_vertex, class boost::vector_property_map<struct boost::graph::python::basic_descriptor<void *,struct boost::bidirectionalS>,str uct boost::graph::python::basic_index_map<struct boost::graph::python::basic_des criptor<void *,struct boost::bidirectionalS>,struct boost::adj_list_vertex_prope rty_map<class boost::adjacency_list<struct boost::listS,struct boost::listS,stru ct boost::bidirectionalS,struct boost::property<enum boost::vertex_index_t,unsig ned int,struct boost::no_property>,struct boost::property<enum boost::edge_index _t,unsigned int,struct boost::no_property>,struct boost::no_property,struct boos t::listS>,unsigned int,unsigned int const &,enum boost::vertex_index_t> > > * pr edecessor_map=None, class boost::vector_property_map<float,struct boost::graph:: python::basic_index_map<struct boost::graph::python::basic_descriptor<void *,str uct boost::bidirectionalS>,struct boost::adj_list_vertex_property_map<class boos t::adjacency_list<struct boost::listS,struct boost::listS,struct boost::bidirect ionalS,struct boost::property<enum boost::vertex_index_t,unsigned int,struct boo st::no_property>,struct boost::property<enum boost::edge_index_t,unsigned int,st ruct boost::no_property>,struct boost::no_property,struct boost::listS>,unsigned int,unsigned int const &,enum boost::vertex_index_t> > > * distance_map=None, c lass boost::vector_property_map<float,struct boost::graph::python::basic_index_m ap<struct boost::graph::python::basic_descriptor<class boost::detail::edge_desc_ impl<struct boost::bidirectional_tag,void *>,struct boost::bidirectionalS>,struc t boost::adj_list_edge_property_map<struct boost::bidirectional_tag,unsigned int ,unsigned int const &,void *,struct boost::property<enum boost::edge_index_t,uns igned int,struct boost::no_property> const ,enum boost::edge_index_t> > > {lvalu e} weight_map, class boost::python::api::object visitor=None, class boost::vecto r_property_map<enum boost::default_color_type,struct boost::graph::python::basic _index_map<struct boost::graph::python::basic_descriptor<void *,struct boost::bi directionalS>,struct boost::adj_list_vertex_property_map<class boost::adjacency_ list<struct boost::listS,struct boost::listS,struct boost::bidirectionalS,struct boost::property<enum boost::vertex_index_t,unsigned int,struct boost::no_proper ty>,struct boost::property<enum boost::edge_index_t,unsigned int,struct boost::n o_property>,struct boost::no_property,struct boost::listS>,unsigned int,unsigned int const &,enum boost::vertex_index_t> > > * color_map=None) dijkstra_shortest_paths(class boost::graph::python::basic_graph<struct boost ::undirectedS> graph, struct boost::graph::python::basic_descriptor<void *,struc t boost::undirectedS> root_vertex, class boost::vector_property_map<struct boost ::graph::python::basic_descriptor<void *,struct boost::undirectedS>,struct boost ::graph::python::basic_index_map<struct boost::graph::python::basic_descriptor<v oid *,struct boost::undirectedS>,struct boost::adj_list_vertex_property_map<clas s boost::adjacency_list<struct boost::listS,struct boost::listS,struct boost::un directedS,struct boost::property<enum boost::vertex_index_t,unsigned int,struct boost::no_property>,struct boost::property<enum boost::edge_index_t,unsigned int ,struct boost::no_property>,struct boost::no_property,struct boost::listS>,unsig ned int,unsigned int const &,enum boost::vertex_index_t> > > * predecessor_map=N one, class boost::vector_property_map<float,struct boost::graph::python::basic_i ndex_map<struct boost::graph::python::basic_descriptor<void *,struct boost::undi rectedS>,struct boost::adj_list_vertex_property_map<class boost::adjacency_list< struct boost::listS,struct boost::listS,struct boost::undirectedS,struct boost:: property<enum boost::vertex_index_t,unsigned int,struct boost::no_property>,stru ct boost::property<enum boost::edge_index_t,unsigned int,struct boost::no_proper ty>,struct boost::no_property,struct boost::listS>,unsigned int,unsigned int con st &,enum boost::vertex_index_t> > > * distance_map=None, class boost::vector_pr operty_map<float,struct boost::graph::python::basic_index_map<struct boost::grap h::python::basic_descriptor<class boost::detail::edge_desc_impl<struct boost::un directed_tag,void *>,struct boost::undirectedS>,struct boost::adj_list_edge_prop erty_map<struct boost::undirected_tag,unsigned int,unsigned int const &,void *,s truct boost::property<enum boost::edge_index_t,unsigned int,struct boost::no_pro perty> const ,enum boost::edge_index_t> > > {lvalue} weight_map, class boost::py thon::api::object visitor=None, class boost::vector_property_map<enum boost::def ault_color_type,struct boost::graph::python::basic_index_map<struct boost::graph ::python::basic_descriptor<void *,struct boost::undirectedS>,struct boost::adj_l ist_vertex_property_map<class boost::adjacency_list<struct boost::listS,struct b oost::listS,struct boost::undirectedS,struct boost::property<enum boost::vertex_ index_t,unsigned int,struct boost::no_property>,struct boost::property<enum boos t::edge_index_t,unsigned int,struct boost::no_property>,struct boost::no_propert y,struct boost::listS>,unsigned int,unsigned int const &,enum boost::vertex_inde x_t> > > * color_map=None) For reference here is the docstring bgl gives me: Type: function Base Class: <type 'builtin_function_or_method'> String Form: <Boost.Python.function object at 0x04AEE940> Namespace: Interactive Docstring: dijkstra_shortest_paths(graph, root_vertex, predecessor_map = None, distance_map = None, weight_map = None, visitor = None) Computes the shortest paths from the root vertex to every other vertex in a graph. Parameters: graph the graph on which to compute shortest paths will run. It may be either a directed or undirected graph. root_vertex the starting vertex for the shortest-path search. predecessor_map a vertex -> vertex map that stores the predecessor of each vertex in the shortest paths tree. From a given vertex, one can follow the predecessor_map back to the root_vertex to reconstruct the shortest path. distance_map a vertex -> float map that stores the distance from the root_vertex to each vertex in the tree. A distance of infinity in this property map indicates that the vertex is unreachable from the root_vertex. weight_map an edge -> float map that stores the weight of each edge in the graph. Negative edge weights are not permitted. If no weight map is provided, each edge will be assumed to have a weight of 1.0. visitor a visitor that will receive events as the shortest-paths computation progresses. Typically this visitor should be derived from boost.graph.dijkstra_visitor. See also: bellman_ford_shortest_paths dag_shortest_paths dijkstra_visitor Complete C++ documentation is available at: http://www.boost.org/libs/graph/doc/dijkstra_shortest_paths.html Any help appreciated, John.

4 9