MATLAB Code for Dijkstra's Algorithm

The map should consist of nodes and segments, such that:

1. nodes have the format [ID X Y] or [ID X Y Z] (with ID being an integer, and X,Y,Z representing position coordinates and of type double)

2. segments have the format [ID N1 N2] (with ID being an integer, and N1 N2 representing IDs from the nodes list such that there is an [undirected] edge/segment between node N1 and node N2, and obviously of integer type also)

Code Link: https://in.mathworks.com/matlabcentral/fileexchange/12850-dijkstra-s-shortest-path-algorithm

Join us on Telegram: https://t.me/matlabcastor

Join us on Facebook Group: https://www.facebook.com/groups/matlabcodes