Nice. I'd love to see some code that would run networkx.djikstra_path() or networkx.floyd_warshall() against OpenStreetMap data.
On Tue, May 4, 2010 at 5:30 AM, Tyler Erickson <[email protected]> wrote: > pgRouting implements a few non-exact records too. > > This library looks promising too, although I haven't tried it... > http://networkx.lanl.gov/ > http://networkx.lanl.gov/reference/algorithms.shortest_paths.html?highlight=floyd > > > On Mon, May 3, 2010 at 6:54 PM, Francis Markham <[email protected]> wrote: >> >> Is there any *fast* way to create such an origin-destination matrix? If I >> have n origins and m destinations, doing n * m dijsktra shortest path >> queries is very slow. Is a floyd-warshall or similar algorithm supported? >> >> Cheers, >> >> -Francis >> >> On 4 May 2010 05:08, Tyler Erickson <[email protected]> wrote: >>> >>> Check out pgRouting: >>> http://pgrouting.postlbs.org/ >>> >>> On Mon, May 3, 2010 at 11:38 AM, Ricardo Rodríguez >>> <[email protected]> wrote: >>>> >>>> hello all, any of you know any library or know of any script for >>>> analysis of transmission or some script to create matrices of origins and >>>> destinations, and I can not work with arcgis, only free libraries, any >>>> suggestions thank you for your answers and opinions. :) >>>> >>>> Ricardo Rodríguez >>>> Ing. Topográfico >>>> Univalle >>> >> > > -- Sean
