-
Notifications
You must be signed in to change notification settings - Fork 0
/
Graph-Class.cpp
46 lines (43 loc) · 1.02 KB
/
Graph-Class.cpp
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
// Graph Class
//-----------------------------------------------------------------------------------------
class Graph{
int V;
list<pair<int,int>> *l;
public:
Graph(int v)
{
V=v;
l=new list<pair<int,int>>[V];
}
void addEdges(int u,int v,int cost)
{
l[u].push_back({v,cost});
l[v].push_back({u,cost});
}
int dfsHelper(int node,bool *visited,int *count,int &ans)
{
visited[node]=true;
count[node]=1;
for(auto nb_p:l[node])
{
int nb=nb_p.first;
int w=nb_p.second;
if(!visited[nb])
{
count[node]+=dfsHelper(nb,visited,count,ans);
int cx=count[nb];
int cy=V-cx;
ans+=2*min(cx,cy)*w;
}
}
return count[node];
}
int dfs()
{
bool *visited = new bool[V]{0};
int *count= new int[V]{0};
int ans=0;
dfsHelper(0,visited,count,ans);
return ans;
}
};