[Boost-bugs] [Boost C++ Libraries] #11355: Sloan ordering does not work on disconnected graphs

Subject: [Boost-bugs] [Boost C++ Libraries] #11355: Sloan ordering does not work on disconnected graphs
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2015-05-27 16:57:08

#11355: Sloan ordering does not work on disconnected graphs
-----------------------------------------+----------------------
 Reporter:  Jeroen Meijer <jjgmeijer@…>  |      Owner:  jewillco
     Type:  Bugs                         |     Status:  new
Milestone:  To Be Determined             |  Component:  graph
  Version:  Boost 1.58.0                 |   Severity:  Problem
 Keywords:                               |
-----------------------------------------+----------------------
 The Sloan ordering algorithm in graph/sloan_ordering.hpp does not work for
 disconnected graphs.

 This can be easily confirmed by running an example of a graph with two
 disconnected vertices.

 The attached file simply creates a graph with two vertices without any
 edges.
 Running the attached file yields:
 {{{
 i: 0
 i: 0
 }}}

 The result should be:
 {{{
 i: 0
 i: 1
 }}}

 Or the result should be:
 {{{
 i: 1
 i: 0
 }}}

 The problem also holds for larger disconnected graphs.

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