@cached<EOL><INDENT>def independent_vertices(self):<DEDENT>
candidates = set(range(self.num_vertices))<EOL>result = []<EOL>while len(candidates) > <NUM_LIT:0>:<EOL><INDENT>pivot = candidates.pop()<EOL>group = [<EOL>vertex for vertex, distance<EOL>in self.iter_breadth_first(pivot)<EOL>]<EOL>candidates.difference_update(group)<EOL>group.sort()<EOL>result.append(group)<EOL><DEDENT>return result<EOL>
Lists of vertices that are only interconnected within each list

           This means that there is no path from a vertex in one list to a
           vertex in another list. In case of a molecular graph, this would
           yield the atoms that belong to individual molecules.