Shlok Shah shlokstack
nateshmbhat
/ dijkstra_algorithm.cpp
Created
April 28, 2020 04:41
Dijkstra Algorithm for finding shortest path to all vertices from a single source.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include<bits/stdc++.h> | |
| using namespace std ; | |
| int cost[100][100] , n ; | |
| int getMin(int dist[] , bool visited[]){ | |
| int key = 0 ; | |
| int min = INT_MAX ; | |
| for(int i=0;i < n ; i++){ | |
| if(!visited[i] && dist[i]<min){ |