Shortest Distance Between Two Lines in N dimensions by Alexander Brodsky

Function calculates shortest distance between two lines presented by two points for each line. (2d, plot, intersection)

[dist Pc Qc]=distBW2lines(L1,L2)

Advanced Dijkstra's Minimum Path Algorithm by Joseph Kirk

calculates the shortest (least cost) path along edges of a graph using Dijkstra's Algorithm (dijkstra, shortest distance, shortest path)

dijkstra(AorV,xyCorE,SID,FID,iswaitbar)

Dijkstra's Shortest Path Algorithm by Joseph Kirk

calculates the shortest path and distance between two nodes on a map (dijkstra, graph, shortest path)

dijkstra(nodes,segments,start_id,finish_id)