- Boost-users - lists.boost.org

Re: [Boost-users] A request for help using the Boost Unit Test Library
by Tim Allison 28 Feb '08

28 Feb '08

I'm sorry, I completely missed your reply. Based on your comment that the new docs are for 1.34, The contents of FuserTest.cc are cut and pasted from example 1: // each test module could contain no more then one 'main' file with init function defined // alternatively you could define init function yourself #define BOOST_TEST_MAIN #include <boost/test/unit_test.hpp> //____________________________________________________________________________// // most frequently you implement test cases as a free functions with automatic registration BOOST_AUTO_TEST_CASE( test1 ) { // reports 'error in "test1": test 2 == 1 failed' BOOST_CHECK( 2 == 1 ); } //____________________________________________________________________________// // each test file may contain any number of test cases; each test case has to have unique name BOOST_AUTO_TEST_CASE( test2 ) { int i = 0; // reports 'error in "test2": check i == 2 failed [0 != 2]' BOOST_CHECK_EQUAL( i, 2 ); BOOST_CHECK_EQUAL( i, 0 ); } //____________________________________________________________________________// // EOF The error messages are: FuserTests.cc:9: error: expected constructor, destructor, or type conversion before '(' token FuserTests.cc:18: error: expected constructor, destructor, or type conversion before '(' token Tim Allison > > Today's Topics: > > 1. Re: A request for help using the Boost Unit Test Library > (Gennadiy Rozental) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Thu, 21 Feb 2008 20:05:42 +0000 (UTC) > From: Gennadiy Rozental <rogeeff(a)gmail.com> > Subject: Re: [Boost-users] A request for help using the Boost Unit > Test Library > To: boost-users(a)lists.boost.org > Message-ID: <loom.20080221T200258-326(a)post.gmane.org> > Content-Type: text/plain; charset=utf-8 > > Tim Allison <tallison <at> meicompany.com> writes: >> I am using boost 1.33.1-42 <at> 586 on Suse 10.2 (If it matters, my computer >> is a Latitude D510) and Gnu compiler 4.1.3-29 <at> 586 (as listed by Smart >> Package Manager). > > The new docs cover Boost.Test starting 1.34 > >> When I run the make file, it echos out the following line: >> g++ -Wno-deprecated -frepo -m32 -g -I../lib -I/usr/X11R6/include >> -I../../../source/ecs/shared -DOS_IS_LINUX -c FuserTests.cc >> >> FuserTests.cc is the file into which I have attempted to copy the >> examples. > > Would you care to share with us the file content? > >> The case I am most interested in running uses BOOST_AUTO_TEST_CASE( >> functionName ). This line produces the error: >> FuserTests.cc:16: error: expected constructor, destructor, or type >> conversion before ?(? token > > Obviosly Boost.Test headers are not included. > > Gennadiy > > > >

2 1

Boost::Function: Getting a pointer to a template function
by Hans Mull 28 Feb '08

28 Feb '08

Hi! I want to use a boost::function pointer to a template function. The template type should be determinated at the time the boost::function object is initialized. Example: template<class T> inline string addNumber(T inputNumber) { return lexical_cast<string>(inputNumber + 2); } template<class numType> inline boost::function<string(numType)> getFunction(numType number) { boost::function<string(numType)> f; f = //Which code can I use here? If I call f() I want to call addNumber<numType>(number) } ---------------------- I want to use it like that: void callFunction() { boost::function<string(double)> f; f = getFunction<unsigned long>(); for(int i = 0; i < 10000;i++) { std::cout << f(rand()) << endl; } } Thanks in advance, Hans

2 2

Looking for a boost graph algorithm
by Christian Sturz 28 Feb '08

28 Feb '08

Hi, I'm looking for an appropriate Boost Graph algorithm for the following problem: my graph (based on adjacency_list) represents the control-flow graph of a program where each vertex is a statement and the control-flow relations between the statements are modeled by edges. Now I'm looking for an algorithm that finds all vertices that can be reached from a defined statement. So, what I need is a back-traversal of the graph, from the given vertex to all predecessors and so forth. I didn't find any algorithm in the Boost Graph Library. The "strong_components" algorithm might be OK since it assumes a directed graph (as is mine) but the algorithm seems to operate in the direction of the directed edges. Obviously I need the the opposite direction. Do you know any approach/algorithm that might solve my problem? Regards, Chris -- Psssst! Schon vom neuen GMX MultiMessenger gehört? Der kann`s mit allen: http://www.gmx.net/de/go/multimessenger

2 3

Problems connecting to boost repository
by Lang Stefan 28 Feb '08

28 Feb '08

Hello List, I am trying to download (parts of) the current version of boost as described in http://svn.boost.org/trac/boost/wiki/BoostSubversion. I do have a subversion client installed (version 1.4.2) as well as TortoiseSVN for windows. However, so far I have been unable to download any file(s) from the repository at http://svn.boost.org. The IT staff advised me to use a proxy server and a specific port to establish that sort of internet connection, and I found and set the appropriate options for TortoiseSVN. Afterwards, when I tried to use TortoiseSVN for downloading from the boost repository, some administrative data was transferred, but still no actual files. The error messages I got were: REPORT request failed on '/svn/boost/!svn/vcc/default' REPORT of '/svn/boost/!svn/vcc/default': 400 Bad Request (http://svn.boost.org) Can anyone tell me what's wrong, or how to access the boost svn repository properly? I would try out the command line client directly, but am not sure how to set the proxy server and port. Mit freundlichen Grüssen / Kind regards Stefan Lang

2 1

Problems compiling programs with graphviz_read()
by Vivek Menon 28 Feb '08

28 Feb '08

Hello all,I am a newbie to Boost Graph Libraries. I am working on a Mac OSX (Intel) platform. I have compiled the libraries using the bjam executable from boost_1_34_1/tools/jam/src/bin.macosxx86/bjam This resulted in formation of libraries in bin.v2/libs/... Now I would like to compile the edge-connectivity.cpp file in boost_1_34_1/libs/graph/examples directory with the following command: g++ -I$BOOST edge-connectivity.cpp -o test1 $BOOST/bin.v2/libs/graph/build/darwin/debug/link-static/libboost_graph-d-1_34_1.a This gives me the following errors: Undefined symbols: "boost::read_graphviz(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, boost::subgraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_attribute_t, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, boost::no_property>, boost::property<boost::edge_attribute_t, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, boost::property<boost::edge_index_t, int, boost::no_property> >, boost::property<boost::graph_graph_attribute_t, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, boost::property<boost::graph_vertex_attribute_t, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, boost::property<boost::graph_edge_attribute_t, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, boost::property<boost::graph_name_t, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::no_property> > > >, boost::listS> >&)", referenced from: _main in cctmckT6.o ld: symbol(s) not found collect2: ld returned 1 exit status Can some one explain what's going on? I have tried using -L option as well with no success: g++ -I$BOOST edge-connectivity.cpp -o test1 -L$BOOST/boost_1_34_1/bin.v2/libs/graph/build/darwin/debug/link-static/ -lboost_graph-d-1_34_1.a The examples that do not use graphviz_read() are easily compiled. I would also like to know if someone uses a jam file that lists all the dependencies for the example files. This way I can compile all the example files in the /libs/graph/examples in one shot with no linking problems. Thanks, Vivek

1 0

[enable_if] Compiler Error with MSVC 7.1
by Christian Henning 28 Feb '08

28 Feb '08

Hi there, I'm trying to compile the following code using MSVC 7.1 but it fails. Using MSVC 8 works which leaves me with the impression that it might be a compiler bug. #include <boost/utility/enable_if.hpp> #include <boost/mpl/bool.hpp> using namespace boost; template < typename A > struct is_A : public mpl::true_ {}; template < typename B > struct is_B : public mpl::true_ {}; template< typename A > struct enable_if_A : public enable_if< typename is_A< A >::type > {}; template< typename B > struct enable_if_B : public enable_if< typename is_B< B >::type > {}; template < typename One > inline void foo( typename enable_if_A< One >::type* ptr = 0 ) {} template < typename One > inline void foo( typename enable_if_B< One >::type* ptr = 0 ) {} int _tmain(int argc, _TCHAR* argv[]) { return 0; } After a while of tinkering I got it to compile when inheriting the enable_if helper classes from enable_if<...>::type instead of from enable_if<...>. The following works: #include <boost/utility/enable_if.hpp> #include <boost/mpl/bool.hpp> using namespace boost; template < typename A > struct is_A : public mpl::true_ {}; template < typename B > struct is_B : public mpl::true_ {}; template< typename A > struct enable_if_A : public enable_if< typename is_A< A >::type >::type {}; template< typename B > struct enable_if_B : public enable_if< typename is_B< B >::type >::type {}; template < typename One > inline void foo( typename enable_if_A< One >* ptr = 0 ) {} template < typename One > inline void foo( typename enable_if_B< One >* ptr = 0 ) {} int _tmain(int argc, _TCHAR* argv[]) { return 0; } Is that a known issue with MSVC 7.1? Or is it always better to inherit from enable_if<...>::type? Regards, Christian

1 0

The Graph Library Applied to Trees
by Charles Brockman 28 Feb '08

28 Feb '08

I'm considering using the Boost Graph Library to represent binary trees in my application. This will be a planar acyclic directed graph with an adjacency-list representation. The vertices will have properties bundled in an exterior class. A. While building the tree I need to track the depth of each branch and the greatest depth of any branch, that is, the distance from the source vertex to the farthest target vertex. For that I plan to use the distance_recorder. Is that reasonable? Are there pitfalls? Is there a better way? B. I'll need to calculate the total length of the tree by which I mean the sum of all edges. I plan to do a depth-first search and increment a counter with a visitor event point such as discover_vertex. Is that the preferred method? C. On occasion I'll have to swap vertices between two independent trees. My plan is to just swap the bundled properties of each vertex. At first I considered the remove_vertex function but the edges connected to a vertex must be removed first with clear_vertex so before I remove the vertex I'll have to record the source and the target vertices. Then I'll have to add the replacement vertex into the correct position. I can imagine that blowing up in my face. I would appreciate any guidance on this problem. -- Charles Brockman

1 0

gzip_compressor cannot be flushed and closed properly
by Mengda Wu 27 Feb '08

27 Feb '08

Hi, I have a code block trying to output a series of gzip files. I wish to have all the files flushed after the block. But the files can only be flushed after exiting the whole program. The files still have zero size after I try to close them. I am using std::vector to store all the pointers to boost filtering_ostream. Can you help? //Open iostreams char filename[20]; std::vector<boost::iostreams::filtering_ostream *> os_vector; for(i=0; i<4; i++) { sprintf(filename, "file_%d.gz", i ); std::ofstream *of = new std::ofstream(filename, std::ios_base::binary); boost::iostreams::filtering_ostream* os = new boost::iostreams::filtering_ostream; os->push(boost::iostreams::gzip_compressor()); os->push(*of); os_vector->push_back(os); } //Output something for(i=0; i<4; i++) { boost::iostreams::filtering_ostream* os = os_vector[i]; os<<"Output something here" << std::endl; } //Close streams for(i=0; i<4; i++) { boost::iostreams::filtering_ostream* os = os_vector[i]; os->strict_sync(); os->pop(); os->reset(); } Thanks, Mengda

3 6

[interprocess] Many-to-many communication
by Boris 27 Feb '08

27 Feb '08

I have an application which needs to communicate with several other applications on the same machine. I thought to use message queues but quickly ran into a problem: Either I create as many threads as there are message queues which all block and wait for incoming data or I constantly poll all message queues. The later should be easily possible with try_receive(). However it doesn't sound like a good idea to poll continuously? And I assume integrating the message queue somehow into Boost.Asio is not something easily possible? Thus for many-to-many communication shared memory is probably the way to go? Boris

3 2

BGL: Bug in depth_first_search
by Christian Sturz 27 Feb '08

27 Feb '08

Hi, as it seems I've found a bug in the depth_first_search algorithm. I want to use it with my own ColorMap and a start vertex. Here is the code taken from http://www.boost.org/libs/graph/example/dfs-example.cpp with some slight modifications: ------------------------------------ include <boost/graph/adjacency_list.hpp> #include <boost/graph/depth_first_search.hpp> #include <boost/pending/integer_range.hpp> #include <boost/pending/indirect_cmp.hpp> #include <iostream> using namespace boost; template < typename TimeMap > class dfs_time_visitor:public default_dfs_visitor { typedef typename property_traits < TimeMap >::value_type T; public: dfs_time_visitor(TimeMap dmap, TimeMap fmap, T & t) : m_dtimemap(dmap), m_ftimemap(fmap), m_time(t) { } template < typename Vertex, typename Graph > void discover_vertex(Vertex u, const Graph & g) const { put(m_dtimemap, u, m_time++); } template < typename Vertex, typename Graph > void finish_vertex(Vertex u, const Graph & g) const { put(m_ftimemap, u, m_time++); } TimeMap m_dtimemap; TimeMap m_ftimemap; T & m_time; }; int main() { // Select the graph type we wish to use typedef adjacency_list < vecS, vecS, directedS > graph_t; typedef graph_traits < graph_t >::vertices_size_type size_type; // Set up the vertex names enum { u, v, w, x, y, z, N }; char name[] = { 'u', 'v', 'w', 'x', 'y', 'z' }; // Specify the edges in the graph typedef std::pair < int, int >E; E edge_array[] = { E(u, v), E(u, x), E(x, v), E(y, x), E(v, y), E(w, y), E(w, z), E(z, z) }; #if defined(BOOST_MSVC) && BOOST_MSVC <= 1300 graph_t g(N); for (std::size_t j = 0; j < sizeof(edge_array) / sizeof(E); ++j) add_edge(edge_array[j].first, edge_array[j].second, g); #else graph_t g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); #endif // Typedefs typedef boost::graph_traits < graph_t >::vertex_descriptor Vertex; Vertex root = source( edge_array[2],g ); typedef size_type* Iiter; // discover time and finish time properties std::vector < size_type > dtime(num_vertices(g)); std::vector < size_type > ftime(num_vertices(g)); size_type t = 0; dfs_time_visitor < size_type * >vis(&dtime[0], &ftime[0], t); std::vector<default_color_type> color(num_vertices( g ) ); depth_first_search(g, visitor(vis), &color[0], root ); return 0; } ------------------------------------ So, I've added a ColorMap and a start vertex as 3. and 4. argument to "depth_first_search". This code can't be compiled with the gcc on a Debian Etch machine. These are the compiler errors: dfs.cc: In function `int main()': dfs.cc:47: warning: unused variable 'name' /usr/include/boost/graph/depth_first_search.hpp: In function `void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits<G>::vertex_descriptor) [with VertexListGraph = main()::graph_t, DFSVisitor = boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>, ColorMap = boost::default_color_type*]': dfs.cc:76: instantiated from here /usr/include/boost/graph/depth_first_search.hpp:197: error: 'struct boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>' has no member named 'initialize_vertex' dfs.cc:76: instantiated from here /usr/include/boost/graph/depth_first_search.hpp:200: error: 'struct boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>' has no member named 'start_vertex' dfs.cc:76: instantiated from here /usr/include/boost/graph/depth_first_search.hpp:207: error: 'struct boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>' has no member named 'start_vertex' /usr/include/boost/graph/depth_first_search.hpp: In function `void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::no_property, boost::no_property, boost::listS>, DFSVisitor = boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>, ColorMap = boost::default_color_type*, TerminatorFunc = boost::detail::nontruth2]': /usr/include/boost/graph/depth_first_search.hpp:201: instantiated from `void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits<G>::vertex_descriptor) [with VertexListGraph = main()::graph_t, DFSVisitor = boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>, ColorMap = boost::default_color_type*]' dfs.cc:76: instantiated from here /usr/include/boost/graph/depth_first_search.hpp:103: error: 'struct boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>' has no member named 'discover_vertex' /usr/include/boost/graph/depth_first_search.hpp:201: instantiated from `void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits<G>::vertex_descriptor) [with VertexListGraph = main()::graph_t, DFSVisitor = boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>, ColorMap = boost::default_color_type*]' dfs.cc:76: instantiated from here /usr/include/boost/graph/depth_first_search.hpp:120: error: 'struct boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>' has no member named 'examine_edge' /usr/include/boost/graph/depth_first_search.hpp:201: instantiated from `void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits<G>::vertex_descriptor) [with VertexListGraph = main()::graph_t, DFSVisitor = boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>, ColorMap = boost::default_color_type*]' dfs.cc:76: instantiated from here /usr/include/boost/graph/depth_first_search.hpp:123: error: 'struct boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>' has no member named 'tree_edge' /usr/include/boost/graph/depth_first_search.hpp:201: instantiated from `void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits<G>::vertex_descriptor) [with VertexListGraph = main()::graph_t, DFSVisitor = boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>, ColorMap = boost::default_color_type*]' dfs.cc:76: instantiated from here /usr/include/boost/graph/depth_first_search.hpp:127: error: 'struct boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>' has no member named 'discover_vertex' /usr/include/boost/graph/depth_first_search.hpp:201: instantiated from `void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits<G>::vertex_descriptor) [with VertexListGraph = main()::graph_t, DFSVisitor = boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>, ColorMap = boost::default_color_type*]' dfs.cc:76: instantiated from here /usr/include/boost/graph/depth_first_search.hpp:133: error: 'struct boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>' has no member named 'back_edge' /usr/include/boost/graph/depth_first_search.hpp:201: instantiated from `void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits<G>::vertex_descriptor) [with VertexListGraph = main()::graph_t, DFSVisitor = boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>, ColorMap = boost::default_color_type*]' dfs.cc:76: instantiated from here /usr/include/boost/graph/depth_first_search.hpp:136: error: 'struct boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>' has no member named 'forward_or_cross_edge' /usr/include/boost/graph/depth_first_search.hpp:201: instantiated from `void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits<G>::vertex_descriptor) [with VertexListGraph = main()::graph_t, DFSVisitor = boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>, ColorMap = boost::default_color_type*]' dfs.cc:76: instantiated from here /usr/include/boost/graph/depth_first_search.hpp:141: error: 'struct boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>' has no member named 'finish_vertex' /usr/include/boost/graph/depth_first_search.hpp: In member function `void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>, Graph = main()::graph_t]': /usr/include/boost/concept_check.hpp:48: instantiated from `void boost::function_requires(boost::mpl::identity<T>*) [with Concept = boost::DFSVisitorConcept<boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>, main()::graph_t>]' /usr/include/boost/graph/depth_first_search.hpp:191: instantiated from `void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits<G>::vertex_descriptor) [with VertexListGraph = main()::graph_t, DFSVisitor = boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>, ColorMap = boost::default_color_type*]' dfs.cc:76: instantiated from here /usr/include/boost/graph/depth_first_search.hpp:36: error: 'struct boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>' has no member named 'initialize_vertex' /usr/include/boost/graph/depth_first_search.hpp:37: error: 'struct boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>' has no member named 'start_vertex' /usr/include/boost/graph/depth_first_search.hpp:38: error: 'struct boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>' has no member named 'discover_vertex' /usr/include/boost/graph/depth_first_search.hpp:39: error: 'struct boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>' has no member named 'examine_edge' /usr/include/boost/graph/depth_first_search.hpp:40: error: 'struct boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>' has no member named 'tree_edge' /usr/include/boost/graph/depth_first_search.hpp:41: error: 'struct boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>' has no member named 'back_edge' /usr/include/boost/graph/depth_first_search.hpp:42: error: 'struct boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>' has no member named 'forward_or_cross_edge' /usr/include/boost/graph/depth_first_search.hpp:43: error: 'struct boost::bgl_named_params<dfs_time_visitor<main::size_type*>, boost::graph_visitor_t, boost::no_property>' has no member named 'finish_vertex' So, there seem to be a bug in the algorithm. When calling it as defined in the exampl file from the Boost side without a ColorMap and a vertex, it works fine. Could you verify this and tell me if you can reproduce it? Thank you. Regards, Christian -- GMX startet ShortView.de. Hier findest Du Leute mit Deinen Interessen! Jetzt dabei sein: http://www.shortview.de/?mc=sv_ext_mf@gmx

1 0