Boost logo

Boost :

From: jsiek_at_[hidden]
Date: 2000-05-25 19:33:10


I've made a first stab at a file dependency example. It is in the
new copy of the docs that I've uploaded, and the example source
is in the new snapshot.



Moore, Paul writes:
> As an example of a practical problem which is not restricted to graph
> "experts", consider file dependencies. It's basically graph construction,
> plus topological sort, but it might make a nice "tutorial" example. Build a
> dependency graph of files, then use the algorithms to do things like
> 1. Produce a full recompilation order (topological sort, by modified date)
> 2. Produce a "parallel" recompilation order (same as above, but group files
> which can be built in parallel)
> 3. Change analysis (if I change file x, which others need recompiling)
> 4. Dependency changes (if I add a dependency between file x and file y, what
> are the effects)
> This sort of example is very concrete (everyone has seen make) and would
> give a nice solid introduction to why "normal users" would want to use the
> graph classes. It's a bit like the STL map class - out of context, it is
> just an obscure theoretical construct, but when linked with the idea of
> associative arrays, it suddenly becomes very clear why it's important...
> [[ Actually, in general, C++ could do with more concrete examples of how the
> library can be used in real world problems... ]]
> Anyway, I hope this is of some use,
> Paul.
> ------------------------------------------------------------------------
> Failed tests, classes skipped, forgotten locker combinations.
> Remember the good 'ol days
> ------------------------------------------------------------------------

Boost list run by bdawes at, gregod at, cpdaniel at, john at