|
Boost Users : |
From: Douglas Gregor (doug.gregor_at_[hidden])
Date: 2006-11-22 09:06:02
On Tue, 2006-11-21 at 04:23 +0100, Alexander Holler wrote:
> Hello,
>
> I've already though some time that something does not work as expected
> using the way the various file_dependencies.cpp examples have done for
> calculating what files could be compiled in parallel. Because I've now
> got to a point where I really need something working, I've just done it
> myself. ;)
>
> My solution is pretty simple, and it basically works like it is
> described in the documentation for the example, walk through the tree
> and calculate the maximum distance. To achieve that, I'm just using the
> result from topological_sort and calculating the maximum through a walk
> through the in_edges of the vertices.
Wonderful, thank you! We'll get this fixed ASAP.
Cheers,
Doug
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net