Question!!!
-
i need the algorithm for the a program that can gives a the shortest path between two spacific points and you are given the distance between every two points
-
i need the algorithm for the a program that can gives a the shortest path between two spacific points and you are given the distance between every two points
nightmare_112 wrote:
i need the algorithm for the a program that can gives a the shortest path between two spacific points
Maybe you need a new major. (Okay, I know that was mean...but I couldn't resist.) See here: wiki Shortest Path[^]
--EricDV Sig--------- Some problems are so complex that you have to be highly intelligent and well informed just to be undecided about them. - Laurence J. Peters
-
i need the algorithm for the a program that can gives a the shortest path between two spacific points and you are given the distance between every two points
You need google ?
Christian Graus - Microsoft MVP - C++ Metal Musings - Rex and my new metal blog
-
i need the algorithm for the a program that can gives a the shortest path between two spacific points and you are given the distance between every two points
http://blogs.msdn.com/chabrook/archive/2006/02/13/Shortest-Path-Algorithm-_2D00_-QuickGraph.aspx[^]
the last thing I want to see is some pasty-faced geek with skin so pale that it's almost translucent trying to bump parts with a partner - John Simmons / outlaw programmer
Deja View - the feeling that you've seen this post before. -
i need the algorithm for the a program that can gives a the shortest path between two spacific points and you are given the distance between every two points
It's not a question. :| If you have a complete set of distances (edges) between every two of all points then the shortest way between two given points will be line segment that connects these two points. If you mean one of typical graph problems then try reading this article.
-
It's not a question. :| If you have a complete set of distances (edges) between every two of all points then the shortest way between two given points will be line segment that connects these two points. If you mean one of typical graph problems then try reading this article.
dead_link wrote:
If you have a complete set of distances (edges) between every two of all points then the shortest way between two given points will be line segment that connects these two points.
Not neccesarily. Your statement also requires the triangle inequality to hold true. AB 1 BC 1 AC 10 The shortest path from A to C is AB-BC, not AC.
-- Rules of thumb should not be taken for the whole hand.
-
dead_link wrote:
If you have a complete set of distances (edges) between every two of all points then the shortest way between two given points will be line segment that connects these two points.
Not neccesarily. Your statement also requires the triangle inequality to hold true. AB 1 BC 1 AC 10 The shortest path from A to C is AB-BC, not AC.
-- Rules of thumb should not be taken for the whole hand.
Correct me if I'm wrong, but those segments (AB, BC, and AC) cannot be a triangle (the length of one side HAS to be less than the sum of the lengths of the other two sides).:) If I'm misunderstanding the discussion, it wouldn't be a first time, so just tell me, "That's not what we're talking about," and I'll back out gracefully. Just thought I'd throw in two cents.
-Daniel Typing too fast fro my owngood
-
Correct me if I'm wrong, but those segments (AB, BC, and AC) cannot be a triangle (the length of one side HAS to be less than the sum of the lengths of the other two sides).:) If I'm misunderstanding the discussion, it wouldn't be a first time, so just tell me, "That's not what we're talking about," and I'll back out gracefully. Just thought I'd throw in two cents.
-Daniel Typing too fast fro my owngood
You're completely correct, on a flat surface the segments don't make a triangle. The triangle inequality states that for any A, B, and C that AB + BC > AC. Dead_link's answer implictly assumed that the inequality was in place, but the OP never made it an actual condition of his problem.
-- Rules of thumb should not be taken for the whole hand.
-
You need google ?
Christian Graus - Microsoft MVP - C++ Metal Musings - Rex and my new metal blog
What's the shortest path to to Google?
only two letters away from being an asset
-
dead_link wrote:
If you have a complete set of distances (edges) between every two of all points then the shortest way between two given points will be line segment that connects these two points.
Not neccesarily. Your statement also requires the triangle inequality to hold true. AB 1 BC 1 AC 10 The shortest path from A to C is AB-BC, not AC.
-- Rules of thumb should not be taken for the whole hand.