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-31 19:32:27

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

Comment (by jewillco):

 I've added your code to the Boost trunk, but I still need a couple of
 changes (please attach patches to the bug report for those):

   * The documentation files do not include copyright or license
 information; could you please send a patch with that added?
   * Where should your algorithm be in the table of contents of the
 documentation?  I put it in the "Miscellaneous Algorithms" part for now.

 Also, here are some changes I made; please tell me if you disagree:

   * I put the `hawick_circuits.cpp` file from the root directory of your
 Github repository into `libs/graph/example` and added it as a file to
 build there.
   * I removed two lines (`typedef`s) from `cycle_test.hpp` to fix GCC
 warnings about unused `typedef`s.

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