patch applied (packages/fgl): Bug fix in bcc

[Martin Erwig]

Tue May 27 10:36:43 PDT 2008  Reid Barton <rwbarton at math.harvard.edu>
  * Bug fix in bcc
  The previous implementation of splitGraphs was incorrect.  It searched
  a list of graphs for the one containing the vertex to be split at, and
  constructed a list of components formed by splitting that vertex, but
  rather than replacing the graph in the list that was split, it always
  replaced the first graph in the list.
  
  The file test/bcc.hs contains an example where the list of biconnected
  components returned by the old bcc function did not have the property
  that each edge of the original graph belongs to exactly one
  biconnected component.

    M ./Data/Graph/Inductive/Query/BCC.hs -11 +12
    A ./test/bcc.hs

View patch online:
http://darcs.haskell.org/packages/fgl/_darcs/patches/20080527173643-80e3b-d6b910076f53475c7db0d439f75d2d5becf8eafc.gz