get the number of childs of the node id */
| 18 | public: |
| 19 | /* get the number of childs of the node id */ |
| 20 | int getchildn(int id) { |
| 21 | for (vector<int>::iterator it = ut[id].begin(); it < ut[id].end(); ) { |
| 22 | if (visited[*it]) ut[id].erase(it); |
| 23 | else it ++ ; |
| 24 | } |
| 25 | visited[id] = true; |
| 26 | return ut[id].size(); |
| 27 | } |
| 28 | |
| 29 | // p -> possibility to reach this node `id` |
| 30 | void dfs(int id, double p, int round_left) { |
nothing calls this directly
no outgoing calls
no test coverage detected