Comments on: Computing All Shortest Paths in Python http://www.depthfirstsearch.net/blog/2009/12/03/computing-all-shortest-paths-in-python/ “We can only see a short distance ahead, but we can see plenty there that needs to be done." Sun, 15 Aug 2010 15:37:37 +0000 hourly 1 http://wordpress.org/?v=3.0.1 By: chris http://www.depthfirstsearch.net/blog/2009/12/03/computing-all-shortest-paths-in-python/#comment-268 chris Wed, 07 Apr 2010 14:11:02 +0000 http://www.depthfirstsearch.net/blog/?p=1744#comment-268 do you have the full set of code? like an example beginning to end? do you have the full set of code? like an example beginning to end?

]]> By: Vin http://www.depthfirstsearch.net/blog/2009/12/03/computing-all-shortest-paths-in-python/#comment-267 Vin Tue, 19 Jan 2010 23:37:14 +0000 http://www.depthfirstsearch.net/blog/?p=1744#comment-267 We switched to repmat because it made the code run an order of magnitude faster on the MATLAB at the time. The problem with outer products is that it replicates the given vector by repeatedly performing floating-point multiplication by 1, as opposed to simply making copies of the entries. cheers Vin We switched to repmat because it made the code run an order of magnitude faster on the MATLAB at the time. The problem with outer products is that it replicates the given vector by repeatedly performing floating-point multiplication by 1, as opposed to simply making copies of the entries.

cheers
Vin

]]> By: depth first search » Computing All Shortest Paths in Matlab http://www.depthfirstsearch.net/blog/2009/12/03/computing-all-shortest-paths-in-python/#comment-266 depth first search » Computing All Shortest Paths in Matlab Thu, 10 Dec 2009 02:42:40 +0000 http://www.depthfirstsearch.net/blog/?p=1744#comment-266 [...] compared two Python implementations for computing shortest paths in a previous post. This was all inspired by some Matlab code for computing Isomap that contained the following [...] [...] compared two Python implementations for computing shortest paths in a previous post. This was all inspired by some Matlab code for computing Isomap that contained the following [...]

]]> By: JS http://www.depthfirstsearch.net/blog/2009/12/03/computing-all-shortest-paths-in-python/#comment-265 JS Fri, 04 Dec 2009 18:31:24 +0000 http://www.depthfirstsearch.net/blog/?p=1744#comment-265 This has all sorts of real world applications! What you describe, however, seems like a shortest path problem of a slightly different sort. You want shortest paths that are constrained to include certain way points (the locations of the components of the order). The algorithm above computes the shortest paths between any two points, not any five, ten, or more points. What you describe seems closer to another famous (and much harder!) problem known as the traveling salesman problem: http://en.wikipedia.org/wiki/Travelling_salesman_problem. This has all sorts of real world applications! What you describe, however, seems like a shortest path problem of a slightly different sort. You want shortest paths that are constrained to include certain way points (the locations of the components of the order). The algorithm above computes the shortest paths between any two points, not any five, ten, or more points. What you describe seems closer to another famous (and much harder!) problem known as the traveling salesman problem: http://en.wikipedia.org/wiki/Travelling_salesman_problem.

]]> By: Chris http://www.depthfirstsearch.net/blog/2009/12/03/computing-all-shortest-paths-in-python/#comment-264 Chris Fri, 04 Dec 2009 17:26:43 +0000 http://www.depthfirstsearch.net/blog/?p=1744#comment-264 I wonder, does this have real world applications? For instance, shortest path would be very helpful in a warehouse/distribution center setting. It would be highly beneficial to be able to determine the shortest route through a warehouse when filling a multiple item order. I wonder, does this have real world applications? For instance, shortest path would be very helpful in a warehouse/distribution center setting. It would be highly beneficial to be able to determine the shortest route through a warehouse when filling a multiple item order.

]]>