Returns an unused key for edges between nodes
vdo not need to be already in the graph.
In the standard MultiGraph class the new key is the number of existing edges between
v(increased if necessary to ensure unused). The first edge will have key 0, then 1, etc. If an edge is removed further new_edge_keys may not be in this order.
u, v (nodes)
- Return type