Re: route finder
- From: "antonio" <giampietro.a@xxxxxxxxxx>
- Date: Mon, 15 May 2006 20:15:04 +0200
Paul,
I have to apply this problem to a pocket Pc, therefore I don't have a big
cpu (pocketpc's cpu is 400mhz).
Do you think I could solve my problem through an NP-complete ?
"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam DOT
com> ha scritto nel messaggio news:eEzAhiEeGHA.4040@xxxxxxxxxxxxxxxxxxxxxxx
No, I'm afraid that my college days were 20 years ago, nearly, too, so
everything that I might have would be out of print my now (and in English,
of course). I would guess, though, that most second- or third-year
computer science data structures course books would mention the problem.
One thing about it is that it is (or was thought to be, in those days), an
NP-complete problem, takes more than linear time to solve for the general
case of multiple destinations and multiple 'streets', so it might be
mentioned in that context.
Paul T.
"antonio" <giampietro.a@xxxxxxxxxx> wrote in message
news:ObjSgeEeGHA.1276@xxxxxxxxxxxxxxxxxxxxxxx
Paul don't worry yourself.
I believe that the only solution is to build alone me the algorithm.
You know a site or book that I use for solve "traveling salesman"
problem.
Thank for you kindliness
Antonio
"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam
DOT com> ha scritto nel messaggio
news:%23BGoT2DeGHA.380@xxxxxxxxxxxxxxxxxxxxxxx
I've never heard of that file type, sorry.
Paul T.
"antonio" <giampietro.a@xxxxxxxxxx> wrote in message
news:eOuvcuDeGHA.4932@xxxxxxxxxxxxxxxxxxxxxxx
Hi Paul, thanks for to answer.
I am serchind just the algorithmic.
Files that I would like to use are of the type shapefile (.shp .shx),
but I don't know if I am wrong in to consider these.
I have to make the thesis on this matter.
Thank for help.
Antonio
"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam
DOT com> ha scritto nel messaggio
news:uM4MhiDeGHA.1276@xxxxxxxxxxxxxxxxxxxxxxx
You need algorithmic help, then, and how you do it is going to depend
on what map data you have. You're basically looking for a solution to
the "traveling salesman" problem, which is a commonly posed problem in
computer science classes. You might be able to find some help in a
data structures or algorithms book found in the bookstore at your
local university. If you bought a GPS library from someone that might
have the ability to find shortest or fastest routes for you...
Paul T.
"antonio" <giampietro.a@xxxxxxxxxx> wrote in message
news:OnpLORDeGHA.2068@xxxxxxxxxxxxxxxxxxxxxxx
Hi Will, excuse for my inaccurate English.
My intention to plan a navigator for car, therefore I have necessity
to
find the route (the minimal way between two points).
I enclose the image.
Thanks for the help
.
- Follow-Ups:
- Re: route finder
- From: Paul G. Tobey [eMVP]
- Re: route finder
- References:
- route finder
- From: antonio
- Re: route finder
- From: Will Chapman
- Re: route finder
- From: antonio
- Re: route finder
- From: Will Chapman
- Re: route finder
- From: Paul G. Tobey [eMVP]
- Re: route finder
- From: antonio
- Re: route finder
- From: Paul G. Tobey [eMVP]
- Re: route finder
- From: antonio
- Re: route finder
- From: Paul G. Tobey [eMVP]
- route finder
- Prev by Date: Re: route finder
- Next by Date: Re: route finder
- Previous by thread: Re: route finder
- Next by thread: Re: route finder
- Index(es):
Relevant Pages
|