[SciPy-User] Dijkstra's algorithm on a lattice
Thu Nov 19 18:25:16 CST 2009
The package networkx has Dijktra's algorithm implemented; if I understand you correctly you'd just need to assign the intensities to the edge weights when you form the network.
I hope this helps!
> From: email@example.com
> To: firstname.lastname@example.org
> Date: Wed, 18 Nov 2009 20:15:55 -0500
> Subject: [SciPy-User] Dijkstra's algorithm on a lattice
> Hi all,
> A bit off-topic, but before I write some C or cython to do this, I
> thought I'd ask to see if anyone knows of existing code for the task
> of finding the shortest (weighted) path between two points on a lattice.
> Specifically, I have images with "start" and "end" pixels marked and I
> want to find the path through the image with the lowest integrated
> intensity. Trivial but tedious to implement, so if anyone has some
> good tips I'd be happy to know. (There's already a left-to-right-
> shortest-path-finder in the image scikit repository, but that's not
> quite what I need.)
> SciPy-User mailing list
Windows 7: It works the way you want. Learn more.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the SciPy-User