UndirectedGraph

1
UndirectedGraph g(n);

1
g.add(vertex, vertex, weight);

1
class UndirectedGraph{
2
public:
3
  struct Edge {
4
    int u,v,cost;
5
  };
6
  const int n;
7
  vector<Edge> g;
8
  UndirectedGraph(int _n):n(_n){}
9
  void add(int u,int v,int cost){
10
    g.push_back({u,v,cost});
11
  }
12
};