def complete(self):
for each in self.nodes():<EOL><INDENT>for other in self.nodes():<EOL><INDENT>if (each != other and not self.has_edge((each, other))):<EOL><INDENT>self.add_edge((each, other))<EOL><DEDENT><DEDENT><DEDENT>
Make the graph a complete graph.

@attention: This will modify the current graph.