44   bool addEdge(uptr from, uptr to) {  in addEdge()
50   uptr addEdges(const BV &from, uptr to, uptr added_edges[],  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()  local
87   bool removeEdgesFrom(const BV &from) {  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()
128   uptr findPath(uptr from, const BV &targets, uptr *path, uptr path_size) {  in findPath()
145   uptr findShortestPath(uptr from, const BV &targets, uptr *path,  in findShortestPath()