[vtkusers] vtkBoostPrimMinimumSpanningTree unexpected result: MST is a forest

[Jeff Baumes]

> However, it never passes the "degree == 0" test, so I'm assuming the
> graph is connected. If that is the case, why would I get this "MST is
> a forest" error? Or have I done something wrong with checking if the
> graph is connected (every vertex must be of degree at least 1)?
>
>
It can still be disconnected with every vertex having degree at least one,
e.g., a 4-vertex undirected graph with the following edges:

0--1
2--3

Jeff
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.vtk.org/pipermail/vtkusers/attachments/20091102/15a4ade3/attachment.htm>