Graph algorithms - minimisation

Gonçalo Rodrigues op73418 at mail.telepac.pt
Tue Sep 10 15:14:50 CEST 2002


On Tue, 10 Sep 2002 09:30:01 GMT, Padraig Brady <Padraig at Linux.ie>
wrote:

>Jesper Olsen wrote:
>> Do you know of python extentions that implement efficient graph
>> algorithms?
>> 
>> In particular I am interested in minimising the number of nodes & arcs
>> used for representing directed graphs.
>> 
>> If you know of implementations in other languages than python - e.g.
>> C/C++, I am interested as well.
>> 
>> Cheers
>> Jesper
>
>Guido wrote an essay on graphs @
>http://www.python.org/doc/essays/graphs.html
>In there is a method to return the shortest path
>which may be useful?

I remember seeing a recipe in ActiveState cookbook with Dijkstra's
algorithm for finding shortest paths. You can then adapt it to your own
representation of a graph. 

>
>Pádraig.

Best regards,
Gonçalo Rodrigues



More information about the Python-list mailing list