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 21:22:51

#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 Louis Dionne <ldionne.2@…>):

 Replying to [comment:5 jewillco]:
 > Instead of `container_contains`, it would probably be better to use
 `std::find` directly (which I believe you did before).
 Fixed.

 > 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?
 I adapted `tiernan_all_cycles.cpp` into a reusable header for cycle
 algorithms, and used it to generate a small unit test for
 `hawick_circuits`. It might also be interesting to use that header from
 `tiernan_all_cycles.cpp` to reduce code duplication.

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