You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
There is a typo in the docstring for the graph automorphism function:
``translation`` - if True, then output includes a a
dictionary translating from keys == vertices to entries == elements
of 1,2,...,n (since permutation groups can currently only act on
positive integers).
Notice that it says "includes a a" (a appears twice).
Also, the doctests in that docstring do not test the partition parameter at all, and it seems to me that would be a very important parameter to illustrate, especially given that the docstring starts {{{
Returns the largest subgroup of the automorphism group of the
(di)graph whose orbit partition is finer than the partition given.
}}}
which suggests that the most important thing the reader should know is that the automorphism_group computes something associated to a partition.
There is a typo in the docstring for the graph automorphism function:
Notice that it says "includes a a" (a appears twice).
Also, the doctests in that docstring do not test the partition parameter at all, and it seems to me that would be a very important parameter to illustrate, especially given that the docstring starts {{{
Returns the largest subgroup of the automorphism group of the
(di)graph whose orbit partition is finer than the partition given.
}}}
which suggests that the most important thing the reader should know is that the automorphism_group computes something associated to a partition.
Component: graph theory
Author: Robert Miller
Reviewer: Emily Kirkman
Merged: sage-4.1.1.alpha0
Issue created by migration from https://trac.sagemath.org/ticket/5939
The text was updated successfully, but these errors were encountered: