Description: The procedure used Dijkstra algorithm to find the minimum path. Enter as a starting point, end point adjacency matrix. The output is the shortest distance, shortest distance corresponds to the distance. Codes are detailed explanatory notes.
To Search:
File list (Check if you may need any files):
Dijkstra.m
Download