Changes between Version 1 and Version 6 of Ticket #27027


Ignore:
Timestamp:
01/07/19 11:35:34 (2 years ago)
Author:
jdemeyer
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #27027

    • Property Commit changed from to fe559c5525eb5ca2f275f847c32e1869b9cbecea
    • Property Branch changed from to u/jdemeyer/graph_relabel___assumes_sortable_vertices
  • Ticket #27027 – Description

    v1 v6  
    1 There are several cases in `relabel()` which assume sorting of vertices. In some cases (when given a list/tuple) this makes sense and is hard to avoid.
     1There are several cases in `relabel()` which assume sorting of vertices.
    22
    3 The following should be fixed though:
     3The following cases are fixed:
    44
    551. `perm=None`. This should just relabel with integers from 0 to N-1.
     
    1111            complete_partial_function = False
    1212}}}
     13
     14Furthermore, we allow arbitrary iterables to be given for relabeling instead of only `list` and `tuple`. This makes things with Python 3 where `range()` becomes an iterator.