本文整理汇总了Python中sage.graphs.graph.Graph.num_verts方法的典型用法代码示例。如果您正苦于以下问题：Python Graph.num_verts方法的具体用法？Python Graph.num_verts怎么用？Python Graph.num_verts使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类sage.graphs.graph.Graph的用法示例。
在下文中一共展示了Graph.num_verts方法的3个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: __classcall_private__
# 需要导入模块: from sage.graphs.graph import Graph [as 别名]
# 或者: from sage.graphs.graph.Graph import num_verts [as 别名]
def __classcall_private__(cls, G):
"""
Normalize input to ensure a unique representation.
TESTS::
sage: G1 = RightAngledArtinGroup(graphs.CycleGraph(5))
sage: Gamma = Graph([(0,1),(1,2),(2,3),(3,4),(4,0)])
sage: G2 = RightAngledArtinGroup(Gamma)
sage: G3 = RightAngledArtinGroup([(0,1),(1,2),(2,3),(3,4),(4,0)])
sage: G1 is G2 and G2 is G3
True
Handle the empty graph::
sage: RightAngledArtinGroup(Graph())
Traceback (most recent call last):
...
ValueError: the graph must not be empty
"""
if not isinstance(G, Graph):
G = Graph(G, immutable=True)
else:
G = G.copy(immutable=True)
if G.num_verts() == 0:
raise ValueError("the graph must not be empty")
return super(RightAngledArtinGroup, cls).__classcall__(cls, G)示例2: __classcall_private__
# 需要导入模块: from sage.graphs.graph import Graph [as 别名]
# 或者: from sage.graphs.graph.Graph import num_verts [as 别名]
def __classcall_private__(cls, G, names=None):
"""
Normalize input to ensure a unique representation.
TESTS::
sage: G1 = RightAngledArtinGroup(graphs.CycleGraph(5))
sage: Gamma = Graph([(0,1),(1,2),(2,3),(3,4),(4,0)])
sage: G2 = RightAngledArtinGroup(Gamma)
sage: G3 = RightAngledArtinGroup([(0,1),(1,2),(2,3),(3,4),(4,0)])
sage: G4 = RightAngledArtinGroup(Gamma, 'v')
sage: G1 is G2 and G2 is G3 and G3 is G4
True
Handle the empty graph::
sage: RightAngledArtinGroup(Graph())
Traceback (most recent call last):
...
ValueError: the graph must not be empty
"""
if not isinstance(G, Graph):
G = Graph(G, immutable=True)
else:
G = G.copy(immutable=True)
if G.num_verts() == 0:
raise ValueError("the graph must not be empty")
if names is None:
names = 'v'
if isinstance(names, six.string_types):
if ',' in names:
names = [x.strip() for x in names.split(',')]
else:
names = [names + str(v) for v in G.vertices()]
names = tuple(names)
if len(names) != G.num_verts():
raise ValueError("the number of generators must match the"
" number of vertices of the defining graph")
return super(RightAngledArtinGroup, cls).__classcall__(cls, G, names)示例3: __init__
# 需要导入模块: from sage.graphs.graph import Graph [as 别名]
# 或者: from sage.graphs.graph.Graph import num_verts [as 别名]
def __init__(self, G, names):
"""
Initialize ``self``.
TESTS::
sage: G = RightAngledArtinGroup(graphs.CycleGraph(5))
sage: TestSuite(G).run()
"""
self._graph = G
F = FreeGroup(names=names)
CG = Graph(G).complement() # Make sure it's mutable
CG.relabel() # Standardize the labels
cm = [[-1]*CG.num_verts() for _ in range(CG.num_verts())]
for i in range(CG.num_verts()):
cm[i][i] = 1
for u,v in CG.edge_iterator(labels=False):
cm[u][v] = 2
cm[v][u] = 2
self._coxeter_group = CoxeterGroup(CoxeterMatrix(cm, index_set=G.vertices()))
rels = tuple(F([i + 1, j + 1, -i - 1, -j - 1])
for i, j in CG.edge_iterator(labels=False)) # +/- 1 for indexing
FinitelyPresentedGroup.__init__(self, F, rels)