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

Jamfile to use system boost
by Darren Dale 18 Dec '07

18 Dec '07

Hi, I am new to boost, working through the quickstart example as documented at http://www.boost.org/libs/python/doc/building.html . I have gotten to the point where I can move the test project out of the boot source tree, and run the tests by directing the Jamroot back to the boost source tree. The next step I would like to take is to build the test project using my system's boost (version 1.34.1, installed using gentoo's package manager), rather than the svn checkout. This question has been asked on this list before, but was not resolved: http://www.nabble.com/-python--jam-file-to9942060.html#a9942060 . Is it possible to use boost without the boost source tree? If so, what should I look for so I can point my Jamroot to the right place? As it stands, I am stuck in the same place as the previous poster. If gentoo hasn't installed all of the necessary files, maybe I could improve gentoo's handling of the package. Thank you, Darren

1 0

Interprocess: which version to use?
by Michael Shepanski 18 Dec '07

18 Dec '07

Hello, I want to start using boost::interprocess. My needs are fairly modest, so I don't need a large feature set, but reliability is valuable. Also I need it to be compatible with the rest of boost 1.34.1. So which is the best version of interprocess for me to download and use? Thanks, --- Michael

1 0

Visual Studio .NET 2008 compiler #defines?
by legalize+jeeves＠mail.xmission.com 18 Dec '07

18 Dec '07

[Please do not mail me a copy of your followup] I'm using boost 1.34.1 with the Boost Consultants installer. I tried compiling some code with Visual Studio 2008 and of course 1.34.1 doesn't recognize the compiler and prints out a lot of "compiler not recognized" messages. The code seems to compile OK, but obviously the compiler isn't recognized. Are there plans to update the #defines to recognize VS.NET 2008 soon, or should I do something to update the headers? (Would this mean I'd have to recompile all the libs? I'm using the precompiled libs at the moment.) Thanks in advance. -- "The Direct3D Graphics Pipeline" -- DirectX 9 draft available for download <http://www.xmission.com/~legalize/book/download/index.html> Legalize Adulthood! <http://blogs.xmission.com/legalize/>

4 4

time_series
by Sebastian Weber 17 Dec '07

17 Dec '07

Hello everyone! I am wondering about the time_series library. It got accepted a while ago and I thought it will be included in boost 1.35.0. However, I can not find time_series in subversion - its not in the trunk, nor in sandbox or any other suspicious places. Only the quite old version in the sandbox on boost-consulting seems to be available. What happened? Can someone enlighten me, please? The library looks really useful and I am willing to use it in my project. Are there any alternatives by the way which can compete with boost.time_series and are as well written in C++? Greetings, Sebastian

2 1

Run-time flavors of Boost (aka lib suffix / runtime-options)
by Benoit Sigoure 17 Dec '07

17 Dec '07

Hello list, Boost libraries often ship compiled in various different "flavors" (compiled with different runtime-options). First off, is there an official place where this is documented? I didn't find any, besides the header `boost/config/auto_link.hpp'. Based on this header, I tried to document the suffix used by Boost libraries as follows: > A suffix is one or more of the following letters: sgdpn (in that > order). s = static > runtime, d = debug build, g = debug/diagnostic runtime, p = STLPort > build, > n = (unsure) STLPort build without iostreams from STLPort (it looks > like `n' > must always be used along with `p'). Additionally, it can start > with `mt-' to > indicate for multi-thread builds. Is this accurate? What is a `static runtime'? My guess is that `-s' is Windows-specific, because on Windows it's common to see both shared libraries and static libraries using the same naming scheme `libfoo.lib' (because in the shared library case, `libfoo.lib' is not a directly shared library but rather an import library), can anyone confirm that? This entails that for most UNIX-like OSes, the `-s' variant doesn't exist, it's the `libfoo.a' static archive that is used instead, is that correct? Cheers, -- Benoit Sigoure aka Tsuna EPITA Research and Development Laboratory

3 3

Error while using read_graphml function of graphml.cpp
by tonyaim83 17 Dec '07

17 Dec '07

Hi. I m making use of the code given on http://article.gmane.org/gmane.comp.lib.boost.devel/146836 I m able to compile these files successfully and also able to link it with the Expat parser. But when i m trying to run this from command prompt it throws me following error. "This application has requested the Runtime to terminate it in an unusual way.Please contact the application's support team for more information." What can the reason for this... Kindly help.. -- View this message in context: http://www.nabble.com/Error-while-using-read_graphml-function-of-graphml.cp… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

BoostCon 2008: May 4-9
by David Abrahams 17 Dec '07

17 Dec '07

The 2nd annual Boost Conference has been scheduled for May 4-9 2008. Please save the date! Registration should open sometime in the next week. If you want to stay at the Aspen Meadows (highly recommended as it is within walking distance of the conference venue and was the site of great after-hours discussions in '07), it's especially important this year that you book your rooms early. Since, unlike last year, Aspen's airport will be open this May, demand for rooms has been heavy. In fact, the following week, which we tried to get, was snapped up by another group before we even had a chance to catch our breath, just weeks after BoostCon'07 ended. We'll be working hard on getting the program together for 2008 over the coming weeks. We hope to include many more Boost authors and contributors, and build in several more intensive library-specific sessions, to make 2008 better than ever. Please send any questions to the BoostCon planning committee at: boostcon-plan(a)lists.boost-consulting.com Those of you who didn't make it to BoostCon'07 may want to have a look at the photo gallery at http://boostcon.com/community/photos, peruse the 2007 program at http://boostcon.com/program, and check out the two trip reports mentioned here: http://boostcon.com/news/2007/Jul/16/yet-another-trip-report. See you in Aspen! -- The BoostCon Planning Committee

1 0

[review] Review of Unordered library begins today December 7
by Ion Gaztañaga 16 Dec '07

16 Dec '07

Hi all, The formal review of the Unordered library, proposed by Daniel James, begins today : *Description*: An implementation of the unordered containers specified in TR1, with most of the changes from the recent draft standards. *Author*: Daniel James *Download*: http://www.boost-consulting.com/vault/index.php?action=downloadfile&filenam… The documentation is in the zip file. I've put documentation online here: http://igaztanaga.drivehq.com/unordered http://tinyurl.com/yw8wjp What to include in Review Comments ================================== Your comments may be brief or lengthy, but basically the Review Manager needs your evaluation of the library. If you identify problems along the way, please note if they are minor, serious, or showstoppers. Here are some questions you might want to answer in your review: * What is your evaluation of the design? * What is your evaluation of the implementation? * What is your evaluation of the documentation? * What is your evaluation of the potential usefulness of the library? * Did you try to use the library? With what compiler? Did you have any problems? * How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? * Are you knowledgeable about the problem domain? And finally, every review should answer this question: * Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. Unordered containers are likely to become one of the most used Boost libraries so I encourage you to review the library in order to see if Unordered fulfills all your expectations. Ion Gaztañaga - Review Manager -

6 8

[boost-users] tokenizer vs string algorithm split.
by chun ping wang 15 Dec '07

15 Dec '07

Hi I was wondering which one is better and faster to split a file of csv value of number and put it into container of double. 1.) Which option is better. // method 1. std::vector<std::string> split_string; boost::algorithm::trim(flist); boost::algorithm::split(split_string, flist, boost::algorithm::is_any_of(",")); std::vector<double> elements; BOOST_FOREACH(std::string s, split_string) { elements += boost::lexical_cast<double>(s); } // method 2. boost::char_separator<char> sep(","); boost::tokenizer<boost::char_separator<char> > tokens(flist, sep); std::vector<double> elements; BOOST_FOREACH(std::string token, tokens) { elements += boost::lexical_cast<double>(token); } 2.) When is it better to use string algorithm split instead of tokenizer and vice versa.

6 10

Re: [Boost-users] Linking problem trying to use mutex, condition
by Brian Krahmer 15 Dec '07

15 Dec '07

So it turns out that I wasn't linking against the thread library. I assumed there wasn't a thread library (all implemented in headers) because when I tried to get it to build by doing 'bjam --with-libraries=regex,serialization,thread', it didn't do anything with thread. I then tried 'bjam --with-thread --with-regex --with-serialization', and that seems to work. BTW, I tried building using a parallel make (-j3), but there were errors in the build process. It appears perhaps there's a bug in the parallel compilation or the jamfile for thread. thanks, brian

2 1

Interprocess documentation
by Stefan Funck 15 Dec '07

15 Dec '07

Hi, could someone please give a hint where to find the interprocess documentation? http://igaztanaga.drivehq.com/interprocess seems to be broken, also http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/interproces… as given in doc/html/interprocess.html from the current svn trunk does not work. thanks, Stefan

3 2

Linking problem trying to use mutex, condition
by Brian Krahmer 15 Dec '07

15 Dec '07

I'm trying to compile a test program using the ReadWriteMutex example at http://paulbridger.net/read_write_lock, and I'm getting about 30 linking errors referring to mutex, lock_error and the like. I'm on an Ubuntu system, using boost 1.33.1. I'm including "boost/thread/mutex.hpp" and "boost/thread/condition.hpp". I can post more details, but was wondering if anybody was familiar with this problem. thanks, brian

1 0

Can Lambda dynamic create template parameter？
by Guo Xu 15 Dec '07

15 Dec '07

I want to implement the grammar like this, to create template parameter dynamicly, set< int, ( _1 > _2 ) > intset; can lambda do it ,and how to ?

2 1

[signals, MSVC8.1] Hang in signals constructor when upgrading from 1.33.1 to 1.34.1
by Kris Braun 14 Dec '07

14 Dec '07

Hi there, Trying to upgrade from 1.33.1 to 1.34.1 on Visual Studio 2005, I'm experiencing an infinite loop in the signals code. It happens when named_slot_map constructor calls groups.clear(), which ends up in some standard library iterator cleanup code (_Clean_up_iter_debug). It appears there's a circular link in some pointers to parents. This is happening on a debug build with both Boost and my project compiled with _HAS_ITERATOR_DEBUGGING=0. The problem does not appear on non-debug builds. The signals constructor is running inside the function below, which is called during C++ static initialization: static boost::signal< void( E& ) >& GetHandler( void ) { static boost::signal< void( E& ) > _Handler; return _Handler; } Does anybody have any idea what has changed between 1.33.1 and 1.34.1 that would cause this behaviour change? Thanks, Kris --------------------------------------------------------------------- This transmission (including any attachments) may contain confidential information, privileged material (including material protected by the solicitor-client or other applicable privileges), or constitute non-public information. Any use of this information by anyone other than the intended recipient is prohibited. If you have received this transmission in error, please immediately reply to the sender and delete this information from your system. Use, dissemination, distribution, or reproduction of this transmission by unintended recipients is not authorized and may be unlawful.

1 0

[Boost.MultiIndex] map by string and search by char*
by dariomt＠gmail.com 14 Dec '07

14 Dec '07

I'm trying to use Boost-MultiIndex to achieve: 1) the equivalent (or similar) functionality & performance of an std::map<std::string, ValType> with searches by std::string 2) perform searches by const char* without creating a temporary std::string and without copying the actual char's --------------------------code----------------------- #include <string> #include <functional> #include <cassert> #include <boost/multi_index_container.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/member.hpp> using namespace boost; using namespace boost::multi_index; struct elem { std::string m_key; double m_value; elem( const std::string& key, double value) : m_key(key), m_value(value) {} }; struct less_string : std::less<std::string> { using std::less<std::string>::operator(); // use operator< bool operator() (const std::string& lhs, const char* rhs) const {return lhs < rhs;} bool operator() (const char* lhs, const std::string& rhs) const {return lhs < rhs;} }; typedef multi_index_container< elem, indexed_by< ordered_unique< member<elem,std::string,&elem::m_key>, less_string > > > elem_set; int main() { elem_set s; s.insert( elem("p", 1.0) ); assert( s.find("p") != s.end() ); // no temporary and no data copy! I did it! return 0; } --------------------------code----------------------- Is this the right way to go? Any hint will be appreciated. TIA PS: I know I'm actually getting something more like a std::set, it's ok

2 1

BGL support for graphml
by abhishek.v＠tcs.com 14 Dec '07

14 Dec '07

Hi.. I have downloaded the graphml.cpp, graphml.hpp, reader_test.cc and the test xml file. To check whether the code posted by Tiago on http://article.gmane.org/gmane.comp.lib.boost.devel/146836 to see if it is working fine or not. I m able to build the project and link the libraries of expat as well in Dev-Cpp. But while executing the exe file i m getting an error "This application has requested the Runtime to terminate it in an unusual way. Please contact the application's support team for more information." What could be the reason for this. Also i want to know from where i should download the latest version of graphml.cpp and graphml.hpp. As i have downloaded the latest version of boost from the sourceforge site but in this the graphml.cpp and graphml.hpp files are missing. Currently i m working with the version of Tiago but let me know if stable version are going to be included in the standard boost package or this itself is a the latest and stable version and i m missing out something. Thanks Abhishek Vyas ____________________________________________ =====-----=====-----===== Notice: The information contained in this e-mail message and/or attachments to it may contain confidential or privileged information. If you are not the intended recipient, any dissemination, use, review, distribution, printing or copying of the information contained in this e-mail message and/or attachments to it are strictly prohibited. If you have received this communication in error, please notify us by reply e-mail or telephone and immediately and permanently delete the message and any attachments. Thank you

1 0

STL Maps
by merlin antony 14 Dec '07

14 Dec '07

hi, i'm using stl maps in my project to create maps. this stl maps is datatype specific. eg map<int,int>, map <string,int>, etc.. is they any way to create a template map like map<T,T>. so that the map is compatible across any datatype being passed to it? is it possible to do in boost library by using property map concept? thanx, merlin.

2 1

Recursive grammar problem
by john 14 Dec '07

14 Dec '07

Hello, I have a string I want to parse that is like that A or A or A or ( C or C or C or ( D) or C) or B. Obviously A and B are just something else but we don't care about it here. I define it as mystring = (A | (ch_p('(') >> A >> ch_p(')'))) >> * ("or" >> (A | mystring)) the problem is that as this is exactly the same over and over, I'm getting the end results in the furthest mystring possible: B will be part of "( C or C or C or ( D) or C) or B" and not of the total string and that messes my grammar :( I have no idea how to pass that trouble, so any help on that would be appreciated (well if anyone understood what I said ;) ) Thanks

2 1

Serialization of STL containers?
by Joseph Turian 14 Dec '07

14 Dec '07

I am unable to serialize STL containers. Here's an example, with error message foo.cpp: #include <iostream> #include <fstream> #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/serialization/list.hpp> #include <boost/archive/tmpdir.hpp> class bus_route { friend class boost::serialization::access; std::list<int> stops; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & stops; } public: bus_route(){} }; main() { std::ofstream ofs("removeme"); boost::archive::text_oarchive oa(ofs); bus_route a; oa << a; } ==== $ gcc -o foo foo.cpp /usr/include/boost/archive/detail/oserializer.hpp: In function 'void boost::archive::save(Archive&, T&) [with Archive = boost::archive::text_oarchive, T = bus_route]': /usr/include/boost/archive/basic_text_oarchive.hpp:78: instantiated from 'void boost::archive::basic_text_oarchive<Archive>::save_override(T&, int) [with T = bus_route, Archive = boost::archive::text_oarchive]' /usr/include/boost/archive/detail/interface_oarchive.hpp:78: instantiated from 'Archive& boost::archive::detail::interface_oarchive<Archive>::operator<<(T&) [with T = bus_route, Archive = boost::archive::text_oarchive]' foo.cpp:29: instantiated from here /usr/include/boost/archive/detail/oserializer.hpp:567: error: invalid application of 'sizeof' to incomplete type 'boost::STATIC_ASSERTION_FAILURE<false>' Any idea what I'm doing wrong?

2 3

weird bug, std::list nodes don't work properly with pool_allocator.
by Flogromp N. 14 Dec '07

14 Dec '07

/* The pool allocator is not being used properly, somehow, with std::list. When you go to purge the pool, it says nothing was purged, because nothing is even registered as being allocated in the pool. What is going on here? I have included copious debugging information. I've even provided a dummy modification of the boost::pool_allocator class to show what's going on. It's weird. If you change l_type to an std::vector, everything will work, and the output will be: purged? 1 This program outputs the following when l_type is std::list, debug_pool_allocator<Tag, T, UserAllocator, Mutex, NextSize>::debug_pool_allocator() [with Tag = foo_tag, T = int, UserAllocator = boost::default_user_allocator_new_delete, Mutex = boost::details::pool::default_mutex, unsigned int NextSize = 32u] debug_pool_allocator<Tag, T, UserAllocator, Mutex, NextSize>::debug_pool_allocator(const debug_pool_allocator<Tag, U, UserAllocator, Mutex, NextSize>&) [with U = int, Tag = foo_tag, T = std::_List_node<int>, UserAllocator = boost::default_user_allocator_new_delete, Mutex = boost::details::pool::default_mutex, unsigned int NextSize = 32u] static T* debug_pool_allocator<Tag, T, UserAllocator, Mutex, NextSize>::allocate(typename boost::pool<UserAllocator>::size_type) [with Tag = foo_tag, T = std::_List_node<int>, UserAllocator = boost::default_user_allocator_new_delete, Mutex = boost::details::pool::default_mutex, unsigned int NextSize = 32u] --- static T* debug_pool_allocator<Tag, T, UserAllocator, Mutex, NextSize>::allocate(typename boost::pool<UserAllocator>::size_type) [with Tag = foo_tag, T = std::_List_node<int>, UserAllocator = boost::default_user_allocator_new_delete, Mutex = boost::details::pool::default_mutex, unsigned int NextSize = 32u] --- ... purged? 0 released? 0 This program outputs the following when l_type is std::vector, debug_pool_allocator<Tag, T, UserAllocator, Mutex, NextSize>::debug_pool_allocator() [with Tag = foo_tag, T = int, UserAllocator = boost::default_user_allocator_new_delete, Mutex = boost::details::pool::default_mutex, unsigned int NextSize = 32u] static T* debug_pool_allocator<Tag, T, UserAllocator, Mutex, NextSize>::allocate(typename boost::pool<UserAllocator>::size_type) [with Tag = foo_tag, T = int, UserAllocator = boost::default_user_allocator_new_delete, Mutex = boost::details::pool::default_mutex, unsigned int NextSize = 32u] --- static T* debug_pool_allocator<Tag, T, UserAllocator, Mutex, NextSize>::allocate(typename boost::pool<UserAllocator>::size_type) [with Tag = foo_tag, T = int, UserAllocator = boost::default_user_allocator_new_delete, Mutex = boost::details::pool::default_mutex, unsigned int NextSize = 32u] static void debug_pool_allocator<Tag, T, UserAllocator, Mutex, NextSize>::deallocate(T*, typename boost::pool<UserAllocator>::size_type) [with Tag = foo_tag, T = int, UserAllocator = boost::default_user_allocator_new_delete, Mutex = boost::details::pool::default_mutex, unsigned int NextSize = 32u] --- ... purged? 1 released? 0 */ #include <iostream> using std::cout; using std::endl; #include <list> #include <vector> #include <boost/current_function.hpp> #include <boost/limits.hpp> // std::numeric_limits #include <new> // std::bad_alloc #include <boost/pool/poolfwd.hpp> #include <boost/pool/singleton_pool.hpp> #include <boost/pool/pool_alloc.hpp> #define DEBUG_FUNC cout << BOOST_CURRENT_FUNCTION << " " << endl template < class Tag, class T, class UserAllocator = boost::default_user_allocator_new_delete, class Mutex = boost::details::pool::default_mutex, unsigned NextSize = 32 > class debug_pool_allocator { public: typedef T value_type; typedef UserAllocator user_allocator; typedef Mutex mutex; static unsigned const next_size = NextSize; typedef value_type* pointer; typedef value_type const* const_pointer; typedef value_type& reference; typedef value_type const& const_reference; typedef typename boost::pool<UserAllocator>::size_type size_type; typedef typename boost::pool<UserAllocator>::difference_type difference_type; template <class U> struct rebind { typedef debug_pool_allocator<Tag, U, UserAllocator, Mutex, NextSize> other; }; debug_pool_allocator() { DEBUG_FUNC; } // default copy constructor // default assignment operator // not explicit, mimicking std::allocator [20.4.1] template <class U> debug_pool_allocator( debug_pool_allocator<Tag, U, UserAllocator, Mutex, NextSize> const& ) { DEBUG_FUNC; } // default destructor static pointer address(reference r) { DEBUG_FUNC; return &r; } static const_pointer address(const_reference s) { DEBUG_FUNC; return &s; } static size_type max_size() { DEBUG_FUNC; return (std::numeric_limits<size_type>::max)(); } static void construct(pointer const ptr, value_type const& t) { DEBUG_FUNC; new(ptr) T(t); } static void destroy(pointer const ptr) { DEBUG_FUNC; ptr->~T(); } bool operator==(debug_pool_allocator const&) const { DEBUG_FUNC; return true; } bool operator!=(debug_pool_allocator const&) const { DEBUG_FUNC; return false; } static pointer allocate(size_type const n) { DEBUG_FUNC; const pointer ret = static_cast<pointer>( boost::singleton_pool< Tag, sizeof(T), UserAllocator, Mutex, NextSize >::ordered_malloc(n) ) ; if (ret == 0) throw std::bad_alloc(); return ret; } static pointer allocate(size_type const n, void const* const) { DEBUG_FUNC; return allocate(n); } static void deallocate(pointer const ptr, size_type const n) { DEBUG_FUNC; boost::singleton_pool< Tag, sizeof(T), UserAllocator, Mutex, NextSize >::ordered_free(ptr, n); } }; // --- struct foo_tag {}; // IF YOU CHANGE THIS TO std::vector, IT WILL DEALLOCATE PROPERLY! typedef std::list< int, debug_pool_allocator<foo_tag, int> > l_type; int main() { bool success = false; l_type* l = new l_type; for (int i=0; i<2; ++i) { l->push_back(444); cout << "---" << endl; } cout << "..." << endl; success = boost::singleton_pool<foo_tag, sizeof(int)>::purge_memory(); cout << "purged? " << success << endl; success = boost::singleton_pool<foo_tag, sizeof(int)>::release_memory(); cout << "released? " << success << endl; }

1 0

[review] Boost.Functional/Forward - result
by John Torjo 13 Dec '07

13 Dec '07

Hi all, I'm happy to announce that The Boost.Functional/Forward library has been accepted into Boost. Congrats to Tobias for a great lib! Summary: 5 reviews, all positive. Suggestions for improvement: - Automatically detect if the compiler supports variadic templates and rvalue references and use those instead. This can be a useful portability utility when such compilers become more common. - It should use compressed_pair to store the wrapped function object to take advantage of EBO. - more tweakable parameters for specific uses - like, arity 3 for function X, and arity 5 for function Y - Docs: add more material explaining the forwarding problem - Docs: should be explicitly specified that the wrapped function object must be result_of compatible - Docs: A discussion of the impact of the library on compile time (especially with high values of N) Best, John -- http://John.Torjo.com -- C++ expert ... call me only if you want things done right

2 1

[boost::logging] flushing rolling_file
by Benjamin de Dardel 13 Dec '07

13 Dec '07

Hi all, Does anybody use boost::logging ? I wonder if it's possible to flush logs in a rolling_file as in a standard file (flush_each_time) ? It would be nice ! Thanks, Benjamin

3 6

Re: [Boost-users] [boost] [review] Gentle reminder - Fast track formal review of Boost.Functional/Factory will begin December 17
by John Torjo 13 Dec '07

13 Dec '07

Joel de Guzman wrote: > John Torjo wrote: > >> Hi all, >> >> This is a gentle reminder of the Boost.Functional/Factory review, about >> to start next Monday. >> >> >> Factories are callback mechanisms for constructors, so we provide two >> function objects, boost::value_factory and boost::factory, that >> encasulate object construction through direct application of the >> constructor or operator new, respectively. These templates make other >> facilities that operate on function objects (such as standard >> algorithms, Boost.Bind, Boost.Function, or Fusion functional adapters) >> applicable to constructors. >> >> Get it from here: >> http://www.boost-consulting.com/vault/index.php?action=downloadfile&filenam… >> > > Link to docs please? Thanks! > > I've posted them temporarily on my site - http://www.torjo.com/tobias/ Best, John -- http://John.Torjo.com -- C++ expert ... call me only if you want things done right

1 0

Re: [Boost-users] BGL Max flow min cut
by Line B. Reinhardt 13 Dec '07

13 Dec '07

It is mostly the reverse edge I have problem with. My graph is not necessarily a complete graph and therefore in my graph an reverse edge does not always exist. However I would like to introduce just when running the algorithm. I think I will need two graphs but maybe have a map between the edges which are cooresponding in both graphs. Thanks for your answer. Best regards Line On Dec 10, 2007 7:37 AM, Line B. Reinhardt <lbr(a)ctt.dtu.dk> wrote: > Dear All > I would like some help with graph structure for the edmund_karp max flow min cut function. > I have a general graph in which I have many properties + edge and vertex. I sould like to run edmund karp on this graph however I have not been able to make the structure right for edmund karp and therefore I have made a second graph a flow graph. However I do not want to copy edges over every time I change something in the original graph. I was wundering if I could make it the same graph or just make the flow graph a filteret version of the original graph. > The graphs are defined as follows:: <snip> Hi Line, Can you explain what you mean by "have not been able to make the structure right"? Your original graph needs to have reversed edges (for every edge (u,v) in the graph, (v,u) needs to also be in the graph), but unless you're missing that, you should be able to avoid having to create a separate graph to pass in. If you are missing reversed edges, you won't be able to add them through a filtered graph - a filtered graph only lets you remove some set of vertices and/or edges from the graph. Regards, Aaron _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

[review] Review of Unordered library started December 7 and still running!
by Ion Gaztañaga 13 Dec '07

13 Dec '07

Hi all, The formal review of the Unordered library started December 7, we have a few nice reviews, but they are not enough. If you are interested in the library (and I *know* you are), please take some time to review it. This is the info you need to do a review: *Description*: An implementation of the unordered containers specified in TR1, with most of the changes from the recent draft standards. *Author*: Daniel James *Download*: http://www.boost-consulting.com/vault/index.php?action=downloadfile&filenam… The documentation is in the zip file. I've put documentation online here: http://igaztanaga.drivehq.com/unordered http://tinyurl.com/yw8wjp What to include in Review Comments ================================== Your comments may be brief or lengthy, but basically the Review Manager needs your evaluation of the library. If you identify problems along the way, please note if they are minor, serious, or showstoppers. Here are some questions you might want to answer in your review: * What is your evaluation of the design? * What is your evaluation of the implementation? * What is your evaluation of the documentation? * What is your evaluation of the potential usefulness of the library? * Did you try to use the library? With what compiler? Did you have any problems? * How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? * Are you knowledgeable about the problem domain? And finally, every review should answer this question: * Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. Ion Gaztañaga - Review Manager -

2 1