def clique(graph, id):
clique = [id]<EOL>for n in graph.nodes:<EOL><INDENT>friend = True<EOL>for id in clique:<EOL><INDENT>if n.id == id or graph.edge(n.id, id) == None:<EOL><INDENT>friend = False<EOL>break<EOL><DEDENT><DEDENT>if friend:<EOL><INDENT>clique.append(n.id)<EOL><DEDENT><DEDENT>return clique<EOL>
Returns the largest possible clique for the node with given id.