def __init__ (self, idgenerator = "set") : """ constructor of an empty relation """ self._left_links=IdDict(idgenerator = idgenerator) self._right_links=IdDict(idgenerator = idgenerator) self._link_extremities=IdDict(idgenerator = idgenerator)
def __init__(self, degree, idgenerator="set"): """ constructor of an empty mesh """ self._degree = degree self._borders = [None] + [ IdDict(idgenerator=idgenerator) for i in xrange(degree) ] self._regions = [IdDict(idgenerator=idgenerator) ] + [{} for i in xrange(degree - 1)]
def __init__(self, graph=None, idgenerator = "set"): """constructor if graph is not none make a copy of the topological structure of graph (i.e. don't use the same id) :param graph: the graph to copy, default=None :type graph: Graph """ self._vertices=IdDict(idgenerator = idgenerator) self._edges=IdDict(idgenerator = idgenerator) if graph is not None : dummy=self.extend(graph)