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
>
On Tue, 03 Oct 2006 10:09:19 -0700, Dan Christensen <[EMAIL PROTECTED]> wrote:
> "William" <[EMAIL PROTECTED]> writes:
>
>> Robert has been doing a little preliminary work about what is out
>> there, and putting it here:
>>
>> http://sage.math.washington.edu/home/rlmill/graph_software.html
>>
>> T
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 pr
"William" <[EMAIL PROTECTED]> writes:
> Robert has been doing a little preliminary work about what is out
> there, and putting it here:
>
> http://sage.math.washington.edu/home/rlmill/graph_software.html
>
> The idea of the above page is just to summarize what is currently
> available.
Could b
I have two students at UW (Emily K. and Robert M.) who are doing a
project on
creating "the ultimate" computational graph theory package for SAGE.
Robert has been doing a little preliminary work about what is out
there, and putting it here:
http://sage.math.washington.edu/home/rlmill/graph_softw
I'm interested in this too but don't know about BOOST.
Does anyone know anything about Networkx?
https://networkx.lanl.gov/Readme.html
It is GPL'd.
I think the state-of-the-art is nauty, which (I'm told) is used by MAGMA. It is
"open source" but does not have an open source license. It is includ
