Mirror of git.openembedded.org/meta-openembedded https://git.enea.com/cgit/linux/meta-openembedded.git/atom?h=kirkstone-next 2021-07-16T15:57:37+00:00 2021-07-16T15:57:37+00:00 zangrc zangrc.fnst@fujitsu.com 2021-07-14T21:36:05+00:00 urn:sha1:8f4ef229d8157f310478bb435be96aa338eee8d3 This release is the result of 11 months of work with over 363 pull requests by 91 contributors. Highlights include: Dropped support for Python 3.6. NumPy, SciPy, Matplotlib, and pandas are now default requirements. NetworkX no longer depends on the library “decorator”. Improved example gallery Removed code for supporting Jython/IronPython The __str__ method for graph objects is more informative and concise. Improved import time Improved test coverage New documentation theme Add functionality for drawing self-loop edges Add approximation algorithms for Traveling Salesman Problem New functions: Panther algorithm maximum cut heuristics equivalence_classes dedensification random_ordered_tree forest_str snap_aggregation networkx.approximation.diameter partition_quality prominent_group prefix_tree_recursive topological_generations -License-Update: Copyright year updated to 2021. Add runtime dependency to resolve errors that occurred when import networkx. Signed-off-by: Zang Ruochen <zangrc.fnst@fujitsu.com> Signed-off-by: Khem Raj <raj.khem@gmail.com> Signed-off-by: Trevor Gamblin <trevor.gamblin@windriver.com> 2021-04-06T15:58:42+00:00 Leon Anavi leon.anavi@konsulko.com 2021-04-05T12:49:29+00:00 urn:sha1:6b98728840639ec426d3e8ae06ac064ed73cd24b Upgrade to release 2.5.1: - pagerank uses scipy by default now - New source argument to has_eulerian_path to look for path starting at source - prefix_tree now uses a non-recursive algorithm. The original recursive algorithm is still available via prefix_tree_recursive Signed-off-by: Leon Anavi <leon.anavi@konsulko.com> Signed-off-by: Khem Raj <raj.khem@gmail.com> Signed-off-by: Trevor Gamblin <trevor.gamblin@windriver.com>