On Tue, 03 Oct 2006 10:37:27 -0700, Brian Granger
<[EMAIL PROTECTED]> wrote:
> For what it is worth, I saw a talk about boost.graph this year and was
> very impressed. Some particular things I liked:
>
> - Very high performance - parallel capabilities if I recall correctly
> - Python bindings
> - Very nice C++ design underneath
>
> I am not sure about what algorithms/capabilities it provides though.
> I have also used networkx for simple things before.
>
> I definitely think that the "ultimate graph theory computation"
> package absolutely needs to run effficiently in parallel. This I
> think is the main challenge.
I encourage you to apply to attend
http://sage.math.washington.edu/msri07/
http://www.msri.org/calendar/workshops/WorkshopInfo/410/show_workshop
and contribute your thoughts about parallel graph theory algorithms and
implementations.
William
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~----------~----~----~----~------~----~------~--~---
