Author Topic: Shortest Path along a network  (Read 561 times)

0 Members and 1 Guest are viewing this topic.

themethodman

  • Mosquito
  • Posts: 12
Shortest Path along a network
« on: November 01, 2021, 08:32:50 AM »
Anyone seen a solution for solving for the shortest path from point A to point B along a network of polylines for c# .NET?

Have only been able to find LISP examples.

A little surprised this hasn't been asked before (or I haven't been able to find a relevant previous post).

For reference, this implementation linked below is example what I'm after (just not in lisp!)

https://www.cadforum.cz/en/the-shortest-path-between-two-points-on-a-network-tip10383

It's Alive!

  • Retired
  • Needs a day job
  • Posts: 7244
  • AKA Daniel
Re: Shortest Path along a network
« Reply #1 on: November 01, 2021, 08:07:54 PM »
I thought there was a challenge with this once.
You should be able to port lisp to C#, i know it can be difficult the way some lisp routines are written lol.

 
Retired

dgorsman

  • Water Moccasin
  • Posts: 2437
Re: Shortest Path along a network
« Reply #2 on: November 04, 2021, 11:50:23 AM »
There should be several examples of generic A* pathfinding in C# out there.  The bulk of your work (and it won't be much) would be interpreting the network of plines into nodes and edges.
If you are going to fly by the seat of your pants, expect friction burns.

try {GreatPower;}
   catch (notResponsible)
      {NextTime(PlanAhead);}
   finally
      {MasterBasics;}

Augusto

  • Newt
  • Posts: 58
Re: Shortest Path along a network
« Reply #3 on: November 06, 2021, 10:48:29 AM »

kirby

  • Newt
  • Posts: 57
Re: Shortest Path along a network
« Reply #4 on: November 08, 2021, 07:58:39 AM »
A lisp solution that could be converted to C#
https://www.theswamp.org/index.php?topic=45092.msg503957#msg503957