Skip to content
This repository has been archived by the owner on Jan 30, 2023. It is now read-only.

Commit

Permalink
Merge branch 'u/chapoton/14444' into 6.10.b4
Browse files Browse the repository at this point in the history
Conflicts:
	src/sage/combinat/cluster_algebra_quiver/quiver.py
  • Loading branch information
Frédéric Chapoton committed Nov 12, 2015
2 parents 0d3caa0 + 5de6bd5 commit c364003
Show file tree
Hide file tree
Showing 3 changed files with 424 additions and 233 deletions.
6 changes: 3 additions & 3 deletions src/sage/combinat/cluster_algebra_quiver/mutation_type.py
Original file line number Diff line number Diff line change
Expand Up @@ -272,7 +272,7 @@ def _check_special_BC_cases(dg, n, check_letter_list, check_twist_list,
if not mut_type == 'unknown':
mut_type, conn_verts = mut_type
else:
# when conn_vert_list == False, the output of _connected_mutation_type _AAtildeD is simply 'unknown' or the mutation type.
# when conn_vert_list is False, the output of _connected_mutation_type _AAtildeD is simply 'unknown' or the mutation type.
# no 'connecting vertices' need to be computed.
mut_type = _connected_mutation_type_AAtildeD( dg, ret_conn_vert = False )
conn_verts = []
Expand Down Expand Up @@ -1130,8 +1130,8 @@ def _connected_mutation_type_AAtildeD(dg, ret_conn_vert=False):
else:
long_cycle = [ cycle, ['A',n-1,1] ]
# if we haven't found a "long_cycle", we are in finite type A
if long_cycle == False:
long_cycle = [ [], QuiverMutationType(['A',n]) ]
if not long_cycle:
long_cycle = [[], QuiverMutationType(['A', n])]

# The 'connected vertices' are now computed.
# Attention: 0-1-2 in type A_3 has connecting vertices 0 and 2, while in type D_3 it has connecting vertex 1;
Expand Down

0 comments on commit c364003

Please sign in to comment.