5.9
Trac #8703: Enumerated sets and data structure for ordered and binary trees
- The Class Abstract[Labelled]Tree allows for inheritance from different
  Cython classes.
- Added shape on labelled trees.
- Add a new function as_digraph() that maps a tree to the associated directed
  graph, with edges oriented away from from the root
- Added canopee to binary trees.
- Decreasing and increasing Binary tree of a permutations.
- Added Binary tree insertion.
- Added Binary search tree of a permutation
- removed sage.misc.sagex_ds.BinaryTree from the interface.
- Increase number of matches to "tree" in sagedoc.py doctest (#14433)
Trac #14287: split _test_elements_eq so it can be partially overwritten by padics
Trac #12230: add a test for growing letters
Trac #13693: Fixes for matplotlib 1.2.0
Trac #14159: Optional support for weak values in Triple- and MonoDict. Safer callback.
Trac #14159: Use cdef methods to get faster access to values of a TripleDict
Trac #13184: Unique parent assumption for homset
Trac #14337: implement shuffle algebras
Trac #14337: Review patch for shuffle algebras.
Trac #13606: Adding anticommutator operation of matrices
Trac #13131: Implement a top-level 'table' function.
Trac #13131: fixes spaces and make doc as raw strings
Trac #14394: Better input checking for FaceFan
Trac #14394: Reviewers tweaks to FaceFan and NormalFan.
Trac #14192: Review patch for infinity crystal of tableaux.
Trac #13698: Access to GLPK graph routines
Trac #13698: Access to graph routines of the GLPK -- reviewer's patch
Trac #13698: removed vertex value guessing
Trac #13698: Access to graph routines of the GLPK -- Typos and useless variable