(graph_1, graph_2)
| 58 | return row_ind, col_ind, cost_matrix[row_ind, col_ind].sum() |
| 59 | |
| 60 | def matching(graph_1, graph_2): |
| 61 | indices_1, indices_2, total_cost = compute_assignment_matrix(graph_1, graph_2) |
| 62 | return indices_1, indices_2 |
| 63 | |
| 64 | def ratio_levenshtein(x, y): |
| 65 | assert len(x) == len(y) |
nothing calls this directly
no test coverage detected