29   uptr size() const { return kSize; }  in size()
32     for (uptr i = 0; i < size(); i++)  in clear()
37     for (uptr i = 0; i < size(); i++)  in empty()
44   bool addEdge(uptr from, uptr to) {  in addEdge()
50   uptr addEdges(const BV &from, uptr to, uptr added_edges[],  in addEdges()
51                 uptr max_added_edges) {  in addEdges()
52     uptr res = 0;  in addEdges()
55       uptr node = t1.getAndClearFirstOne();  in addEdges()
69   bool hasEdge(uptr from, uptr to) { return v[from].getBit(to); }  in hasEdge()
72   bool removeEdge(uptr from, uptr to) {  in removeEdge()
79     for (uptr from = 0; from < size(); from++) {  in removeEdgesTo()
91       uptr idx = t1.getAndClearFirstOne();  in removeEdgesFrom()
100   void removeEdgesFrom(uptr from) {  in removeEdgesFrom()
104   bool hasEdge(uptr from, uptr to) const {  in hasEdge()
111   bool isReachable(uptr from, const BV &targets) {  in isReachable()
118       uptr idx = to_visit.getAndClearFirstOne();  in isReachable()
128   uptr findPath(uptr from, const BV &targets, uptr *path, uptr path_size) {  in findPath()
137       uptr idx = it.next();  in findPath()
138       if (uptr res = findPath(idx, targets, path + 1, path_size - 1))  in findPath()
145   uptr findShortestPath(uptr from, const BV &targets, uptr *path,  in findShortestPath()
146                         uptr path_size) {  in findShortestPath()
147     for (uptr p = 1; p <= path_size; p++)  in findShortestPath()
154   void check(uptr idx1, uptr idx2) const {  in check()