Graph algorithms - minimisation
op73418 at mail.telepac.pt
Tue Sep 10 09:14:50 EDT 2002
On Tue, 10 Sep 2002 09:30:01 GMT, Padraig Brady <Padraig at Linux.ie>
>Jesper Olsen wrote:
>> Do you know of python extentions that implement efficient graph
>> 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.
>Guido wrote an essay on graphs @
>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.
More information about the Python-list