Re: [Boost-bugs] [Boost C++ Libraries] #8433: Algorithm for finding all the elementary circuits in a directed (multi)graph

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #8433: Algorithm for finding all the elementary circuits in a directed (multi)graph
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2013-08-16 20:41:46

#8433: Algorithm for finding all the elementary circuits in a directed
(multi)graph
-------------------------+-------------------------------------------------
  Reporter:  Louis       |      Owner:  jewillco
  Dionne                 |     Status:  new
      Type:  Feature     |  Component:  graph
  Requests               |   Severity:  Not Applicable
 Milestone:  To Be       |   Keywords:  graph multigraph circuit cycle
  Determined             |  hawick
   Version:  Boost       |
  1.54.0                 |
Resolution:              |
-------------------------+-------------------------------------------------

Comment (by jewillco):

 Instead of `container_contains`, it would probably be better to use
 `std::find` directly (which I believe you did before).  Are you going to
 have any kind of testing in the Boost version?  It would be nice to at
 least have testing with a small graph or two that makes sure that the code
 compiles and can run simple problems.  Can you use random graphs like the
 `tiernan_all_cycles.cpp` test does?

-- 
Ticket URL: <https://svn.boost.org/trac/boost/ticket/8433#comment:5>
Boost C++ Libraries <http://www.boost.org/>
Boost provides free peer-reviewed portable C++ source libraries.