Makes all edges of the given graph bi-directional.

Updates graph to include a reversed version of each of its edges. Multiple edges between the same source and target node IDs are combined by picking the edge with the largest weight.

graph A dict: source -> (target -> weight) as returned by the read_tsv_graph function.

None. Instead, this function has a side-effect on the graph argument.