Wtd graph

[jefimenko]

No description provided.

[cewing]

This is overly complex. Iterating over a range of the length of a list instead of simply iterating over the list is almost never what you really want. And I don't think it's what you want here. Why couldn't you try something less convoluted, like this:

for pair in self.g[n1]:
    if pair[0] == n2:
        self.g[n1].remove(pair)
        break