def add_vertex(self, i=None):
"""
Add a new vertex with label ``i`` or the least integer which
is not already a vertex.
INPUT:
- ``i`` -- (default None) new vertex with label ``i`` or the
least integer which is not already a vertex.
OUTPUT:
the new vertex.
EXAMPLES::
sage: G = GraphWithInverses([[0,0,'a'],[0,1,'b'],[1,0,'c']])
sage: G.add_vertex()
2
sage: print G
Graph with inverses: a: 0->0, b: 0->1, c: 1->0
sage: print G.vertices()
[0, 1, 2]
"""
if i is None:
i = self.new_vertex()
DiGraph.add_vertex(self, i)
return i
def add_vertex(self, i=None):
"""
Add a new vertex with label ``i`` or the least integer which
is not already a vertex.
INPUT:
- ``i`` -- (default: ``None``) new vertex with label ``i`` or
the least integer which is not already a vertex
OUTPUT:
The new vertex.
EXAMPLES::
sage: from train_track.inverse_graph import GraphWithInverses
sage: G = GraphWithInverses([[0,0,'a'],[0,1,'b'],[1,0,'c']])
sage: G.add_vertex()
2
sage: print (G)
a: 0->0, b: 0->1, c: 1->0
sage: print (G.vertices())
[0, 1, 2]
"""
if i is None:
i = self.new_vertex()
DiGraph.add_vertex(self, i)
return i
def add_vertex(self, i=None):
"""
Add a new vertex with label ``i`` or the least integer which
is not already a vertex.
INPUT:
- ``i`` -- (default: ``None``) new vertex with label ``i`` or
the least integer which is not already a vertex
OUTPUT:
The new vertex.
EXAMPLES::
sage: from train_track.inverse_graph import GraphWithInverses
sage: G = GraphWithInverses([[0,0,'a'],[0,1,'b'],[1,0,'c']])
sage: G.add_vertex()
2
sage: print (G)
a: 0->0, b: 0->1, c: 1->0
sage: print (G.vertices())
[0, 1, 2]
"""
if i is None:
i = self.new_vertex()
DiGraph.add_vertex(self, i)
return i
def add_vertex(self,i=None):
"""
Add a new vertex with label ``i`` or the least integer which
is not already a vertex.
OUTPUT:
the new vertex.
"""
if i==None:
i=self.new_vertex()
DiGraph.add_vertex(self,i)
return i
def add_vertex(self, i=None):
"""
Add a new vertex with label ``i`` or the least integer which
is not already a vertex.
OUTPUT:
the new vertex.
"""
if i == None:
i = self.new_vertex()
DiGraph.add_vertex(self, i)
return i
