1

DirectedGraph g(n);

1

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

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12

class DirectedGraph {
public:
  struct Edge {
    int to, cost;
  };
  const int n;
  vector<vector<Edge>> g;
  DirectedGraph(int _n) : n(_n), g(_n) {}
  void add(int s, int t, int cost) {
    g[s].push_back({t, cost});
  }
};