(self)
return Graph(edges, directed=True)
Returns a new graph that describes the hierarchical relationships
        between the groups.

        The new graph will be a directed tree; an edge will point from
        vertex M{i} to vertex M{j} if group M{i} is a superset of group M{j}.
        In other words, the edges point downwards.
Returns a new graph that describes the hierarchical relationships
        between the groups.
Returns a new graph that describes the hierarchical relationships between the groups .
def hierarchy(self):
        """Returns a new graph that describes the hierarchical relationships
        between the groups.

        The new graph will be a directed tree; an edge will point from
        vertex M{i} to vertex M{j} if group M{i} is a superset of group M{j}.
        In other words, the edges point downwards.
        """
        from igraph import Graph

        edges = [
            pair for pair in zip(self._parent, range(len(self))) if pair[0] is not None
        ]
        return Graph(edges, directed=True)
def hierarchy ( self ) : from igraph import Graph edges = [ pair for pair in zip ( self . _parent , range ( len ( self ) ) ) if pair [ 0 ] is not None ] return Graph ( edges , directed = True )