| 47 | } |
| 48 | |
| 49 | int main() |
| 50 | { |
| 51 | int v; |
| 52 | v = 6; |
| 53 | vector<int> adj[v]; |
| 54 | |
| 55 | // adding edge to graph |
| 56 | add_edge(adj, 0, 1); |
| 57 | add_edge(adj, 0, 2); |
| 58 | add_edge(adj, 0, 3); |
| 59 | add_edge(adj, 1, 4); |
| 60 | add_edge(adj, 1, 5); |
| 61 | add_edge(adj, 2, 5); |
| 62 | |
| 63 | // finding shortes distance |
| 64 | int source = 0; |
| 65 | find_sd(adj, v, source); |
| 66 | return 0; |
| 67 | } |