Finding Shortest path to points

Question

4.00/5 (2 votes)

See more:

Hi
I am looking for a way to draw a connector between two boxes that will draw the shortest non colliding path between two boxes without colliding with other boxes

say I want to draw a path from point 25,10 on the form and point 200,225

and this line shoudl avoid any and all boxes between them
also the rule is that the line can ony incremennt/decrememnet on the x or y axis not both (as to say no vetors)

can anyone give me a quick easy algorithm to do this ?

Posted 8-Jan-13 21:52pm

L Viljoen

Add a Solution

Comments

Sandeep Mewara 9-Jan-13 4:01am

What have you tried so far? Any effort?

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

**Joezer BH** · Accepted Answer · 2013-01-09T21:46:00

Solution 1

Hello Chona1171,

A most common solution algorithm for your problem is to use the Dijkstra's Algorithm.

Click to read about Dijkstra's Algorithm

There's this nice article in CodeProject:
C# - Visualizing Path Finding With Dijkstra, AStar, Bi-directional Dijkstra's, and Bi-directional A* Algorithms[^]

Posted 9-Jan-13 21:46pm

Joezer BH

Updated 20-Jan-13 22:24pm

v3

Comments

Espen Harlinn 10-Jan-13 9:56am

Nice reply :-D

Herbisaurus 18-Aug-13 2:39am

*****
Nice answer!

Jibesh 10-Jan-13 19:07pm

True. 5+