This algorithm is to solve shortest path problem.
Usage
[cost rute] = dijkstra(graph, source, destination)
note : graph is matrix that represent the value of the edge. if node not connected with other node, value of the edge is 0.
example:
Finding shortest path form node 1 to node 7.
>> G = [0 3 9 0 0 0 0;
0 0 0 7 1 0 0;
0 2 0 7 0 0 0;
0 0 0 0 0 2 8;
0 0 4 5 0 9 0;
0 0 0 0 0 0 4;
0 0 0 0 0 0 0;
];
>> [cost rute] = dijkstra(G,1,7)
it will resulting
cost = 15
rute = [7 6 4 5 2 1]
