Dijkstra's Shortest Path algorithm
Andy Robinson
andy at reportlab.com
Tue Dec 12 22:42:40 EST 2000
More information about the Python-list mailing list
Tue Dec 12 22:42:40 EST 2000
- Previous message (by thread): Dijkstra's Shortest Path algorithm
- Next message (by thread): Dijkstra's Shortest Path algorithm
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
On Sat, 9 Dec 2000 00:48:00 -0500, Roy Katz <katz at Glue.umd.edu> wrote: >Hello! > > >For a recent assignment in my computer science class, we coded up a >graph which implements the Shortest Path algorithm (it's a model of >the Internet, with 'web pages' as nodes, and the latency between them >as edges). It took a good two or three days for me in C++, and >I was wondering if Python (or Numerical Python) has anything like this >(a Graph module??). If there isn't, perhaps I should post my class at >SourceForge and try to make an extension out of it :) > Yes, there is. Aaron Watters kjBuckets collections library include a graph type written in C, which has this and several other useful algorithms. www.chordate.com - Andy Robinson
- Previous message (by thread): Dijkstra's Shortest Path algorithm
- Next message (by thread): Dijkstra's Shortest Path algorithm
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the Python-list mailing list