parameters: (self)
docstring: Make a list of size 2**n + 1 where an entry is a vertex
          incidence, each list element contains a list of indexes
          corresponding to that entries neighbours
docstring_summary: Make a list of size 2**n + 1 where an entry is a vertex
          incidence, each list element contains a list of indexes
          corresponding to that entries neighbours
docstring_tokens: Make a list of size 2 ** n + 1 where an entry is a vertex incidence each list element contains a list of indexes corresponding to that entries neighbours
function: def graph_map(self):
          """ Make a list of size 2**n + 1 where an entry is a vertex
          incidence, each list element contains a list of indexes
          corresponding to that entries neighbours"""
  
          self.graph = [[v2.index for v2 in v.nn] for v in self.C0()]
function_tokens: def graph_map ( self ) : self . graph = [ [ v2 . index for v2 in v . nn ] for v in self . C0 ( ) ]