-void find_best_paths(int nb_vertices,
- int nb_edges, int *ea, int *eb, scalar_t *el,
- int source, int sink,
- int *result_edge_occupation) {
- MTPGraph graph(nb_vertices, nb_edges, ea, eb, source, sink);
- graph.find_best_paths(el);
- graph.print_dot();
+scalar_t detection_score(int true_label, scalar_t flip_noise) {
+ if((true_label > 0) == (drand48() < flip_noise)) {
+ return 1.0 + 0.2 * (drand48() - 0.5);
+ } else {
+ return - 1.0 + 0.2 * (drand48() - 0.5);
+ }