DirectedGraph

1
DirectedGraph g(n);

1
g.add(パス始点, パス終点, 重み);

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