| 250 | } |
| 251 | |
| 252 | ScanNode* ScanGraph::getNodeByID(unsigned int id) { |
| 253 | for (unsigned int i = 0; i < nodes.size(); i++) { |
| 254 | if (nodes[i]->id == id) return nodes[i]; |
| 255 | } |
| 256 | return NULL; |
| 257 | } |
| 258 | |
| 259 | bool ScanGraph::edgeExists(unsigned int first_id, unsigned int second_id) { |
| 260 |
no test coverage detected