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 14:42:05

#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):

 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.

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

 3. That's fine; I see that `ClosedMatrix` isn't part of a public interface
 so it can be whatever you want.

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

 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?

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