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 ?
This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)