4,152 questions
You could probably use the backtrack algorithm, and delete the backtracks
is there a path algorithm?
![](data:image/svg+xml, %3Csvg xmlns='http://www.w3.org/2000/svg' height='64' class='font-weight-bold' style='font: 600 30.11764705882353px "SegoeUI", Arial' width='64'%3E%3Ccircle fill='hsl(310.4, 2%, 40%)' cx='32' cy='32' r='32' /%3E%3Ctext x='50%25' y='55%25' dominant-baseline='middle' text-anchor='middle' fill='%23FFF' %3EM%3C/text%3E%3C/svg%3E)
mc
5,426
Reputation points
I am using .net android
and I want to ask that is there any path algorithm?
I have 3 line intersected
I want to find a way from A to B
and remove the other line
Developer technologies .NET .NET MAUI
1 answer
Sort by: Most helpful
-
![](data:image/svg+xml, %3Csvg xmlns='http://www.w3.org/2000/svg' height='64' class='font-weight-bold' style='font: 600 30.11764705882353px "SegoeUI", Arial' width='64'%3E%3Ccircle fill='hsl(211.20000000000002, 61%, 30%)' cx='32' cy='32' r='32' /%3E%3Ctext x='50%25' y='55%25' dominant-baseline='middle' text-anchor='middle' fill='%23FFF' %3EBS%3C/text%3E%3C/svg%3E)
Bruce (SqlWork.com) 77,686 Reputation points Volunteer Moderator2025-06-23T15:21:31.54+00:00 -
mc 5,426 Reputation points
2025-06-23T23:14:02.1766667+00:00 as you know I can not open wikipedia
-
Bruce (SqlWork.com) 77,686 Reputation points Volunteer Moderator
2025-06-24T01:56:02.7833333+00:00 the backtrack algorithm is taught in most computer science courses to learn recursive coding. You should be able to google, or look in any algorithm books.
Sign in to comment -