How do I easily calculate the shortest path between two geographical spots on
a map?
The map is divided into zones. So I guess it is possible to use Dijkstra’s
Shortest Path algorithm, but it seems like a lot of work and I am sure that
it has been done many times before.
From (x,y) coordinates I need to place the user in a zone and find the
shortest path to all other zones.
Any suggestions are more than welcome. I would hate to reinvent the wheel!
Should I look at MS MapPoint or is that overkill?
--
-------------------- 6 2087
If you are talking which road to take, MapPoint web service is certainly an
option. I am fairly sure the expense of development time will outweigh the
expense of using MapPoint.
---
Gregory A. Beamer
MVP; MCP: +I, SE, SD, DBA
*************** ************
Think Outside the Box!
*************** ************
"Lau" wrote: How do I easily calculate the shortest path between two geographical spots on a map? The map is divided into zones. So I guess it is possible to use Dijkstra’s Shortest Path algorithm, but it seems like a lot of work and I am sure that it has been done many times before. From (x,y) coordinates I need to place the user in a zone and find the shortest path to all other zones. Any suggestions are more than welcome. I would hate to reinvent the wheel! Should I look at MS MapPoint or is that overkill?
-- --------------------
MapPoint would be perfect, but we need to make our own maps. Actually all
maps are going to be building plans and that doesn’t appear to be possible in
MapPoint. Or?
Hi,
First of all, I would like to confirm my understanding of your issue. From
your description, I understand that you need to know what shortest path
algorithm MapPoint is using. If there is any misunderstandin g, please feel
free to let me know.
I'm not quite sure about this. Since this question is something related to
MapPoint implementation, I suggest you to try asking in the following
newsgroups besides here.
microsoft.publi c.mappoint
microsoft.publi c.mappoint.webs ervice
HTH.
Kevin Yu
=======
"This posting is provided "AS IS" with no warranties, and confers no
rights."
Sorry, I don’t think I explained myself very good.
I’m not looking for MapPoints “shortest path algorithm”, but any algorithm
that can do the job. We need to make maps of theme parks, hotels, hospitals
i.e.
We idea is to find the shortest path from room A to room B. This is similar
to MapPoint, but it doesn’t seem to be possible to “make” your own maps in
MapPoint.
Therefore we are looking for a “shortest path algorithm” or preferably an
already implemented version.
What you need is graph theory. Here's the first hit from Google: http://www.boost.org/libs/graph/doc/...ry_review.html
You could also look at this: http://www.codeproject.com/cs/miscctrl/quickgraph.asp
It's an attempt to port the library in the first link to C#. I haven't tried
either libraries myself, but it should be a good start for you.
Colin
"Lau" <la*@newsgroup. nospam> wrote in message
news:34******** *************** ***********@mic rosoft.com... Sorry, I don't think I explained myself very good.
I'm not looking for MapPoints "shortest path algorithm", but any algorithm that can do the job. We need to make maps of theme parks, hotels,
hospitals i.e. We idea is to find the shortest path from room A to room B. This is
similar to MapPoint, but it doesn't seem to be possible to "make" your own maps in MapPoint.
Therefore we are looking for a "shortest path algorithm" or preferably an already implemented version.
Hi,
There are many algorithms for us to get the shortest path on a graph.
Dijkstra and A* are two famous and commonly used algorithms. I think
searching through google will return many results. HTH.
Kevin Yu
=======
"This posting is provided "AS IS" with no warranties, and confers no
rights." This thread has been closed and replies have been disabled. Please start a new discussion. Similar topics |
by: ThanhVu Nguyen |
last post by:
Hi all,
I need recommendation for a very fast shortest path algorithm. The
edges are all directed, positive weights. Dijkstra shortest path will
solve it just fine but the if the graph is not parse then it takes about
O(N^2) where N is the # of vertices, too much for large graphs.
Furthermore, I don't need to know the all the path from a...
|
by: Webdad |
last post by:
Hi!
I running my first year as industrial engineer (informatics)
We have an assignment to do :
.... create a playfield (matrix). Some places in that field are
blocked, so you can't pass them. The others are free to go over ...
(I already found that part)
-> http://users.pandora.be/hebbrecht/jochen/c++/test.cpp
|
by: leezard |
last post by:
I am developing a program using VB.NET that will accept a start and end
point, the system then will generate the shortest path to reach the end
point. Anyone here have idea on doing this or some code examples that can
share it with me?
Thanks in advance.
|
by: Dean Slindee |
last post by:
Is there a way to replace the commented out parameter add syntax with a
single line of code, like the .Parameter.Add("@Letter"...) line below (which
does not work)?
'Dim prmLetter As New SqlParameter
'With prmLetter
' .ParameterName = "@Letter"
|
by: Lau |
last post by:
How do I easily calculate the shortest path between two geographical spots on
a map?
The map is divided into zones. So I guess it is possible to use Dijkstra’s
Shortest Path algorithm, but it seems like a lot of work and I am sure that
it has been done many times before.
From (x,y) coordinates I need to place the user in a zone and find the...
| |
by: Shuch |
last post by:
Hi all,
I am in shortage of time...and i want to know if someone has a code
written in c++ or c for finding the shortest path using stack or
queue??????my specifications r as follow:
Input data:
n = integer number representing the number of vertices
k = small integer number representing the maximal vertex degree
G = unoriented labeled...
|
by: costantinos |
last post by:
Hello. I have implemented the Dijkstra shortest path algorithm, it
works fine but I have one question on how I can improve something.
I want to find all the possible shortest paths from a node since there
is a possibility to exist more than one shortest paths with the same
distance.
Does anyone has any idea how this could be done?
Code
|
by: diffuser78 |
last post by:
Is there any function in networkx which can compute the shortest mean
path length. (Shortest length between all pairs of the nodes in the
graph).
Thanks,
|
by: Bytter |
last post by:
Hi everyone,
I need to implement a very quick (performance-wise) Dijkstra shortest
path in python, and found that libboost already has such thing. Problem
is: I cannot find the installation package for my Python 2.4 under
windows. Can someone please provide me instructions for installing
libboost for python?
In alternative, if someone...
|
by: marktang |
last post by:
ONU (Optical Network Unit) is one of the key components for providing high-speed Internet services. Its primary function is to act as an endpoint device located at the user's premises. However, people are often confused as to whether an ONU can Work As a Router. In this blog post, well explore What is ONU, What Is Router, ONU & Routers main...
|
by: Oralloy |
last post by:
Hello folks,
I am unable to find appropriate documentation on the type promotion of bit-fields when using the generalised comparison operator "<=>".
The problem is that using the GNU compilers, it seems that the internal comparison operator "<=>" tries to promote arguments from unsigned to signed.
This is as boiled down as I can make it. ...
| |
by: tracyyun |
last post by:
Dear forum friends,
With the development of smart home technology, a variety of wireless communication protocols have appeared on the market, such as Zigbee, Z-Wave, Wi-Fi, Bluetooth, etc. Each protocol has its own unique characteristics and advantages, but as a user who is planning to build a smart home system, I am a bit confused by the...
|
by: agi2029 |
last post by:
Let's talk about the concept of autonomous AI software engineers and no-code agents. These AIs are designed to manage the entire lifecycle of a software development projectplanning, coding, testing, and deploymentwithout human intervention. Imagine an AI that can take a project description, break it down, write the code, debug it, and then...
|
by: conductexam |
last post by:
I have .net C# application in which I am extracting data from word file and save it in database particularly. To store word all data as it is I am converting the whole word file firstly in HTML and then checking html paragraph one by one.
At the time of converting from word file to html my equations which are in the word document file was convert...
|
by: TSSRALBI |
last post by:
Hello
I'm a network technician in training and I need your help.
I am currently learning how to create and manage the different types of VPNs and I have a question about LAN-to-LAN VPNs.
The last exercise I practiced was to create a LAN-to-LAN VPN between two Pfsense firewalls, by using IPSEC protocols.
I succeeded, with both firewalls in...
|
by: adsilva |
last post by:
A Windows Forms form does not have the event Unload, like VB6. What one acts like?
|
by: 6302768590 |
last post by:
Hai team
i want code for transfer the data from one system to another through IP address by using C# our system has to for every 5mins then we have to update the data what the data is updated we have to send another system
| |
by: muto222 |
last post by:
How can i add a mobile payment intergratation into php mysql website.
| |