Quantcast
Viewing all articles
Browse latest Browse all 7

Dijkstra Shortest Path Algorithm

// description of your code here<code> #include<iostream.h> #include<conio.h> #include<stdlib.h> int adjmatrix[50][50],cost[50][50]; int flag[50],distance[50],predecessor[50]; int source,vertices; int extract_minimum(); void path_show(int); void dijk_alg(); void main() { clrscr(); cout<<"Enter the number...

Viewing all articles
Browse latest Browse all 7

Trending Articles