Need help with finding the shortest distance between 2 points on a network of graph

[rahul_jainMY6RE]

So i need the shortest distance between these 2 points as well as which lines it used to travel to that point every line will have a different layer (L1, L2, L3.....) name so as to differentiate it. i tried djikstra but i am having trouble getting it successfully implementing. can anyone share any lisp or code for this. Please find attached dwg file for your tinkering.

[rahul_jainMY6RE]

Anyone can please help 

[vladimir_michl · Accepted solution]

See e.g. the SPath freeware utility:

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

Vladimir Michl, www.arkance-systems.cz  -  www.cadforum.cz

[rahul_jainMY6RE]

Wow that's a good solution. Thanks, I really really appreciate it. but it is solving only one of my problem the next problem that I am encountering is that as u can see all my lines have different names or they are in separate layer I also want the layer names that line is following. Any lead on that? Like if the path is like P1 to P2 then L18, L9 and then so on