| 56 | } |
| 57 | |
| 58 | static void check_node ( |
| 59 | unsigned long index, |
| 60 | const graph& self |
| 61 | ) |
| 62 | { |
| 63 | // make sure requires clause is not broken |
| 64 | DLIB_CASSERT(index < self.number_of_nodes(), |
| 65 | "\tnode_type& graph::node(index)" |
| 66 | << "\n\tYou have specified an invalid index" |
| 67 | << "\n\tindex: " << index |
| 68 | << "\n\tnumber_of_nodes(): " << self.number_of_nodes() |
| 69 | << "\n\tthis: " << &self |
| 70 | ); |
| 71 | } |
| 72 | |
| 73 | static void check_has_edge ( |
| 74 | unsigned long node_index1, |
nothing calls this directly
no test coverage detected