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:34:44

#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:3 jewillco]:
 > Here are responses to your questions:
 >
 > 1. Yes, you can have the documentation refer to another algorithm's
 documentation, but your page should at least have the function signatures
 and any differences.  Most BGL documentation is in fairly straightforward,
 hand-written HTML; just copy one of the existing pages and modify it for
 your algorithm.

 I wrote documentation in Markdown and generated HTML from it. It looks
 exactly as the rest of the documentation.


 > 2. It looks like `container_contains` does not do any optimizations, so
 you should probably use `boost::graph_detail::find` anyway.

 Since I'm only searching in a vector, there won't be any optimization.
 I'll stick with `container_contains`, since that expresses my intent
 better.

 > 4. OK, perfect forwarding is fine as long as your code works in C++03.

 The code works in C++03 and C++11. It was compiled with Clang 3.3 and G++
 4.9.


 > 5. I'm not seeing exactly where the test graphs (or generators for them)
 are in the repository you give.  How different are they from Graphviz
 format?

 I'm not providing any tests with the algorithm, that's why. The algorithm
 is tested using an external test suite, and it would be fairly complicated
 to migrate those tests to Boost. Basically, you should ignore the
 `hawick_circuits.cpp` file at the root of the repository, which is only
 useful for the external test suite.

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