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

Commit

Permalink
fix #25426
Browse files Browse the repository at this point in the history
  • Loading branch information
stumpc5 committed May 30, 2018
1 parent a1ec959 commit db37923
Showing 1 changed file with 12 additions and 1 deletion.
13 changes: 12 additions & 1 deletion src/sage/graphs/bliss.pyx
Original file line number Diff line number Diff line change
Expand Up @@ -659,7 +659,18 @@ cpdef automorphism_group(G, partition=None, use_edge_labels=True):
sage: automorphism_group(gg).cardinality() # optional - bliss
12
sage: automorphism_group(gg,[[0],[1,2,3,4]]).cardinality() # optional - bliss
6
Making sure that #25426 is fixed:
sage: j = matrix([(3, 2, 1, 0, 0),
....: (2, 2, 0, 1, 0),
....: (1, 0, 3, 0, 2),
....: (0, 1, 0, 2, 1),
....: (0, 0, 2, 1, 2)])
sage: j.automorphisms_of_rows_and_columns()
[((), ()), ((1,3)(2,5), (1,3)(2,5))]
"""
# We need this to convert the numbers from <unsigned int> to
# <long>. This assertion should be true simply for memory reasons.
Expand Down Expand Up @@ -707,7 +718,7 @@ cpdef automorphism_group(G, partition=None, use_edge_labels=True):
gens = automorphism_group_gens_from_edge_list(Vnr, Vout, Vin, Lnr, labels, int2vert, partition, directed)

from sage.groups.perm_gps.permgroup import PermutationGroup
return PermutationGroup(gens,domain=G)
return PermutationGroup(gens,domain=sorted(G))

#####################################################
# old direct interactions graphs <-> bliss graphs
Expand Down

0 comments on commit db37923

Please sign in to comment.