[Digikam-devel] Re: using Boost Graph Library
Gilles Caulier
caulier.gilles at gmail.com
Sat Oct 23 21:46:44 BST 2010
this header will be internal of digiKam core, or external, or both
depending of detection to host computer (as liblensfun, liblqr, etc ?
The idea is to reduce the puzzle of course.
Gilles
2010/10/23 Marcel Wiesweg <marcel.wiesweg at gmx.de>:
> 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
> _______________________________________________
> Digikam-devel mailing list
> Digikam-devel at kde.org
> https://mail.kde.org/mailman/listinfo/digikam-devel
>
More information about the Digikam-devel
mailing list