Want to read Slashdot from your mobile device? Point it at m.slashdot.org and keep reading!

 



Forgot your password?
typodupeerror
What's the story with these ads on Slashdot? Check out our new blog post to find out. ×
Programming

Submission + - Finding My Summer Vacation's Shortest Path->

CowboyRobot writes: "Clay Breshears at Dr. Dobb's has a fun formula for optimizing the drive between multiple cities. "Think of a map as an instance of a graph, the cities are the nodes and the roads between cities are the edges. The length of the road is the weight of the corresponding edge. The All-Pairs Shortest Path problem takes a graph of n nodes represented by an n x n weight matrix, W. The result is an n x n matrix, D (for distance), where the D[i][j] entry holds the minimum weight of the path from node i to node j. Entries in the W matrix can be zero, positive (if a direct edge lies between the two nodes), or the infinity value where there is no direct edge between the nodes.""
Link to Original Source
This discussion was created for logged-in users only, but now has been archived. No new comments can be posted.

Finding My Summer Vacation's Shortest Path

Comments Filter:

"Bond reflected that good Americans were fine people and that most of them seemed to come from Texas." - Ian Fleming, "Casino Royale"

Working...