algorithm/dfs graph.cpp at main · ihbadhon/algorithm · GitHub

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
#include <bits/stdc++.h>

using namespace std;

vector<ll> result;

void addedge(ll n,vector<vector<ll>> &adj)
{
    for(int i=0; i<n; i++)
    {
        ll u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);

    }
}


ll dfs(vector<vector<ll>> &adj, vector<bool> &vis, vii &cost, ll s)
{
   // ll mn = cost[s-1];

    if(!vis[s])
    {
        vis[s] = 1;
        for(auto i:adj[s])
        {
            if(!vis[i])
            {
              dfs(adj,vis,cost,i);
              result.push_back(i);
            }
        }
    }
    //return mn;
}


int main()
{
    Faster;
    ll tc = 1, test = 1;
    while(tc--)
    {
        //solve();
        ll n, e;
        cin >> n >> e;
        vii cost(n);
        cinv(cost);

        vector<vector<ll>> adj(n+1);
        vector<bool> vis(n+1);

        addedge(e,adj);
        // call dfs
    }
}