graphs in python...

[Aaron Watters]

"Diez B. Roggisch" <deets_noospaam at web.de> wrote in message news:<bqlsvd$q67$07$1 at news.t-online.com>...
> Douglas F. Calvert wrote:
> 
> > Hello,
> >  I read "Python Patterns: Implementing Graphs" ...
> 
> Maybe its faster to store the adjacences in a matrix (e.g. Numeric array) -
> some graph ops then are simple matrix ops. 

That will work if the graph is extremely dense.  If it is not I don't
think it is a good idea.  Please also look at kjbuckets available as part
of the gadfly package as either kjbuckets0.py or kjbucketsmodule.c.

http://gadfly.sourceforge.net
http://cvs.sourceforge.net/viewcvs.py/gadfly/gadfly/kjbuckets/
http://cvs.sourceforge.net/viewcvs.py/gadfly/gadfly/gadfly/kjbuckets0.py

   --Aaron Watters

ps: off topic http://xsdb.sourceforge.net
===
An apple every 8 hours will keep 3 doctors away.  --kliban