Re: GLS and Networks

[Tiago de Paula Peixoto <tpeixoto at if dot usp dot br>]

On Sat, 2004-12-04 at 18:32 +0000, John Lamb wrote:
> Jerome BENOIT wrote:
> > Hello List,
> > 
> > I plan to write a short C program in view to simulate networks:
> > is there any GSL like libray which allow basic manipulation on
> > networks ? and compatible with GSL ?
> 
> You could try LEDA 
> (http://www.algorithmic-solutions.com/enledabeschreibung.htm)
> 
> I tend to write my own and use C++ rather than C. Although I'm told you 
> can get C to compile a bit faster, C++ has the standard template 
> library. That's a great advantage when you're programming networks 
> because the standard template library has a lot of the data structures 
> (sets, lists) that you might need and efficient algorithms (find, sort, 
> permute) ready-written and tested. It's compatible with GSL in the sense 
> that you can use some GSL functions (e.g. random number distributions) 
> and features (e.g. representing adjacency matrices).
> 

If you want C++ and metaprograming, check out the boost graph library
(BGL): http://www.boost.org/libs/graph/doc/table_of_contents.html

It contains graph class concepts, implementations, basic algorithms and
a lot of other stuff, all STL-like. It's also compatible with LEDA. It
has nothing to do with GSL though, which I believe doesn't include
anything graph-related.

-- 
Tiago de Paula Peixoto <tpeixoto@if.usp.br>

Attachment: signature.asc
Description: This is a digitally signed message part