(self)
A list implementation that makes sure that edge ids are not overlapping.


        >>> g = SemanticGraph(edges=[Edge(2, rightentityid="Q1", leftentityid="Q2")])
        >>> g.edges.append(Edge(2, rightentityid="Q1", leftentityid="Q2"))
        >>> g
        SemanticGraph([Edge(2, Q2-None->Q1), Edge(3, Q2-None->Q1)])
A list implementation that makes sure that edge ids are not overlapping.
A list implementation that makes sure that edge ids are not overlapping .
def __init__(self):
        """
        A list implementation that makes sure that edge ids are not overlapping.


        >>> g = SemanticGraph(edges=[Edge(2, rightentityid="Q1", leftentityid="Q2")])
        >>> g.edges.append(Edge(2, rightentityid="Q1", leftentityid="Q2"))
        >>> g
        SemanticGraph([Edge(2, Q2-None->Q1), Edge(3, Q2-None->Q1)])
        """
        self._list: List[Edge] = list()
def __init__ ( self ) : self . _list : List [ Edge ] = list ( )