def giant(self):
    "Returns the giant community of the clustered graph.\n\n        The giant component a community for which no larger community exists.\n        @note: there can be multiple giant communities, this method will return\n          the copy of an arbitrary one if there are multiple giant communities.\n\n        @return: a copy of the giant community.\n        @precondition: the vertex set of the graph hasn't been modified since\n          the moment the clustering was constructed.\n        "
    ss = self.sizes()
    max_size = max(ss)
    return self.subgraph(ss.index(max_size))
Returns the giant community of the clustered graph.

The giant component a community for which no larger community exists.
@note: there can be multiple giant communities, this method will return
  the copy of an arbitrary one if there are multiple giant communities.

@return: a copy of the giant community.
@precondition: the vertex set of the graph hasn't been modified since
  the moment the clustering was constructed.
def giant(self):
    "Returns the giant community of the clustered graph.\n\n        The giant component a community for which no larger community exists.\n        @note: there can be multiple giant communities, this method will return\n          the copy of an arbitrary one if there are multiple giant communities.\n\n        @return: a copy of the giant community.\n        @precondition: the vertex set of the graph hasn't been modified since\n          the moment the clustering was constructed.\n        "
    ss = self.sizes()
    max_size = max(ss)
    return self.subgraph(ss.index(max_size))