def remove_vertex(self,v): """ Removes the vertex ``v`` from ``self``. WARNING: ``v`` must be an isolated vertex. """ DiGraph.delete_vertex(self,v)
def remove_vertex(self, v): """ Removes the vertex ``v`` from ``self``. WARNING: ``v`` must be an isolated vertex. """ DiGraph.delete_vertex(self, v)
def remove_vertex(self, v): """ Removes the vertex ``v`` from ``self``. INPUT: - ``v`` vertex to remove (and its inverse) from the alphabet. WARNING: ``v`` must be an isolated vertex. EXAMPLES:: sage: G = GraphWithInverses([[0,0,'a'],[0,1,'b'],[0,0,'c']]) sage: G.remove_edge('b') sage: G.remove_vertex(1) sage: print G Graph with inverses: a: 0->0, c: 0->0 """ DiGraph.delete_vertex(self, v)
def remove_vertex(self, v): """ Remove the vertex ``v`` from ``self``. INPUT: - ``v`` -- vertex to remove (and its inverse) from the alphabet .. WARNING:: ``v`` must be an isolated vertex. EXAMPLES:: sage: from train_track.inverse_graph import GraphWithInverses sage: G = GraphWithInverses([[0,0,'a'],[0,1,'b'],[0,0,'c']]) sage: G.remove_edge('b') sage: G.remove_vertex(1) sage: print(G) a: 0->0, c: 0->0 """ DiGraph.delete_vertex(self, v)