graphs in python...
aaron at reportlab.com
Thu Dec 4 19:56:54 CET 2003
"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.
ps: off topic http://xsdb.sourceforge.net
An apple every 8 hours will keep 3 doctors away. --kliban
More information about the Python-list