added opt_bin_search_tree1, opt_bin_search_tree2 and decode_root_matrix_to_level
v1.6
4 months ago
Added the data structure PC_tree
Improved the implementations of maximum cardinality bipartite matching
v1.5
6 months ago
Added A*
Added Held-Karp for Hamiltonian-Cycle (Traveling Salesman Problem)
Corrected a bug in GraphNamedVertices (when adding multi-edges)
Started to type function parameters
v1.4
1 year ago
Move to GitHub Actions and drop Python 2.7 support completely
Added a Graph class in the module graph, which allows accessing vertices by names instead of indices
Added alternative versions of union_rectangles
Added an alternative version of bellman_ford which marks with distance -infinity the vertices reachable from the source by paths of arbitrary small weight
Added an alternative version of subsetsum
Added FenwickMin, a minimum variant of Fenwick Trees
Added module fft for the Fast Fourier Transformation
Added module karatsuba for multiplying polynomials
Added module pareto for computing the Pareto set in 2 or 3 dimensions
An alternative version of floyd_warshall added by Pascal Ortiz
Changed the web host of the documentation
Corrected the function building the Huffman tree
Fenwick Trees indices now start at zero
Removed erroneous PQ_trees
Renamed module eratosthene into primes. Added the Gries-Misra sieve in this module