Subject: [Boost-bugs] [Boost C++ Libraries] #4236: Code improvement for "graph/planar_canonical_ordering.hpp"
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2010-05-18 15:52:05
#4236: Code improvement for "graph/planar_canonical_ordering.hpp"
------------------------------------+---------------------------------------
Reporter: patcher@⦠| Owner: asutton
Type: Patches | Status: new
Milestone: Boost 1.43.0 | Component: graph
Version: Boost 1.44.0 | Severity: Optimization
Keywords: planar canonical order |
------------------------------------+---------------------------------------
As already mentioned in Ticket #3807 and now in the
[http://www.boost.org/doc/libs/1_43_0/libs/graph/doc/planar_canonical_ordering.html
documentation] of the function the graph for planar_canonical_ordering
must: [[BR]]
a) Be maximal planar. [[BR]]
b) Have at least two vertices. [[BR]]
c) Must contain the edge {v1, v2} on its outer face.
It would be nice, if the code itself can assure that it starts with two
vertices in the outer face (which it should know from the embedding) and
not the user have to assure that this condition is met.
-- Ticket URL: <https://svn.boost.org/trac/boost/ticket/4236> Boost C++ Libraries <http://www.boost.org/> Boost provides free peer-reviewed portable C++ source libraries.
This archive was generated by hypermail 2.1.7 : 2017-02-16 18:50:03 UTC