-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathsssp_unweighted.cpp
More file actions
71 lines (52 loc) · 1.19 KB
/
sssp_unweighted.cpp
File metadata and controls
71 lines (52 loc) · 1.19 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include<bits/stdc++.h>
#include <list>
#include <algorithm>
#include <map>
using namespace std;
template<typename T>
class Graph {
map<T,list<T> > l;
public:
void addEdge(int x, int y){
l[x].push_back(y);
l[y].push_back(x);
}
void breadthFS(T src){
queue<T> q;
map<T,int > dist;
for(auto node_pair:l){
T node = node_pair.first;
dist[node] = INT_MAX;
}
q.push(src);
dist[src]=0;
while(!q.empty()){
T node = q.front();
q.pop();
// cout<<node<<" ";
for(auto nbr:l[node]){
if(dist[nbr]==INT_MAX){
q.push(nbr);
dist[nbr]=dist[node]+1;
}
}
}
//print the dist to every node
for(auto node_pair:l) {
T node = node_pair.first;
int d = dist[node];
cout<<"Node "<<node<<"--> Dist from src "<<d<<endl;
}
}
};
int main(){
Graph<int> g;
g.addEdge(0,1);
g.addEdge(0,3);
g.addEdge(1,2);
g.addEdge(2,3);
g.addEdge(3,4);
g.addEdge(4,5);
g.breadthFS(0);
return 0;
}