> * There are some remaining hard problems in graphs, under current scrutiny > I think. >
The main remaining issues in the graph module are related to isomorphisms, automorphisms, and related methods. 1) #27571: align behaviors of algorithm 'sage' and 'bliss' in `automorphism_group` and fix a doctest in MathonPseudocyclicStronglyRegularGraph generator. When finalized, we will have to fix bugs with `automorphism_group`, `PermutationGroupElement`, and possibly other methods. 2) fix `is_isomorphic` for graphs with edge labels. A first attempt is done in #27232 <https://trac.sagemath.org/ticket/27232>, but this proposal is certainly not satisfactory. One issue is that we can sort lists of unhashable objects (of different types). 3) #27435 deal with a failing doctest in graph_database.py with interactive_query Help is more than welcome !! David. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-devel/bc3d1af3-91f5-4bdb-88dc-2ad28a28b354%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
