@in_place_transformation<EOL>def remove_inconsistent_edges(graph: BELGraph) -> None:
for u, v in get_inconsistent_edges(graph):<EOL><INDENT>edges = [(u, v, k) for k in graph[u][v]]<EOL>graph.remove_edges_from(edges)<EOL><DEDENT>
Remove all edges between node pairs with inconsistent edges.

    This is the all-or-nothing approach. It would be better to do more careful investigation of the evidences during
    curation.