[Digikam-devel] using Boost Graph Library

[Marcel Wiesweg]

Hi,

for some time I have been playing with some new code for the non-destructive 
editing using the Boost Graph Library.

Why?
The editing history of a file is a perfect, natural example of a Directed 
Acyclic Graph. When recognizing this fact, some of the problems we face (some 
of them solved by hand-written solutions) map directly to graph algorithms, 
which are already written.

Another dependency?
It's a compile-time only dependency - only the headers are needed at compile 
time, no library at runtime. It's heavy template code.

What's the problem?
There seems to be some (standard-conform C++) code in BGL bringing MS VC++ 
compilers to crash:
http://www.boost.org/doc/libs/1_43_0/libs/graph/doc/known_problems.html
http://www.boost.org/doc/libs/1_43_0/libs/graph/doc/trouble_shooting.html
but I dont know if we hit these problems, or if it only applies to older 
versions.

So if noone objects, I would really like to add this code. It makes life much 
easier.

Marcel