From: Cromwell Enage (sponage_at_[hidden])
Date: 2004-02-18 11:24:03
the graph that will hold the transposition is supposed
to have no edges in it and to have the same number of
vertices as the input graph. However, looking through
the source code in <boost/graph/copy.hpp>, which the
algorithm uses, I see as many vertices being added to
the output graph as there are in the input graph.
Does this mean that the output graph is actually
supposed to have no vertices to begin with?
In the attached program, if the #if condition is set
to 1, the program does as the documentation currently
suggests, but the output is wrong. With the #if
condition left at 0, the program gives the correct
What's the verdict?
Do you Yahoo!?
Yahoo! Mail SpamGuard - Read only the mail you want.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk