Changes between Version 62 and Version 63 of Ticket #26640


Ignore:
Timestamp:
03/07/19 12:11:12 (5 months ago)
Author:
dcoudert
Comment:

Legend:

Unmodified
Added
Removed
Modified

  • Ticket #26640 – Description

    v62 v63  
    66- direct comparison of vertex labels (e.g., in method `iterator_edges` of `base/sparse_graph.pyx`)
    77- methods using matrices: `adjacency_matrix`, `distance_matrix`, etc. For all these methods, we can now give as input an ordering of the vertices that will be used to order rows and columns. Currently, we use `.vertices()` by default. If we switch to `list(G)` by default, we have to check that it's not breaking algorithms using these matrices.
    8 - sort used in methods for checking isomorphisms w/wo edge labels
     8- sort used in methods for checking isomorphisms w/wo edge labels (see also #27232 and #26800). Sorting of lists of possibly unhashable objects is needed here, or may be  a method for checking that there is a permutation from one list to the other could be enough ?
    99
    1010
    … …  
    1313- #26800        py3: bug with `canonical_label`
    1414- #27232        `is_permutation_of` broken for matrices over cyclotomic fields -- this is due to `is_isomorphic` in graphs.
    15 - `sage.graphs.graph_database`: there is a failing doctest in py3 with `interactive_query`...
    16 
     15- #27435        py3: failing doctest in `graph_database.py` with `interactive_query`
    1716
    1817'''Needs review''':
    … …  
    2019- #27137        pep8 in `digraph_generators.py` (part 4)
    2120- #27138        pep8 in `digraph_generators.py` (part 5)
    22 - #27408        Edge view for graphs
     21- #27408        Edge view for graphs -- introduce deprecation warning for `sort=None` as the plan is to set `sort=False` by default.
    2322
    2423