Gimp 2.8.22 release notes full#

Independent set, max clique, and min-weighted vertex cover.įor full details of the tickets closed for this release (added features and bug fixes) see: New approximation algorithms for dominating set, edge dominating set,

Lists of graphs, and creating the biadjacency matrix of a bipartite graph. Union, disjoint union, compose, and intersection operators that work on New functions for k-clique community finding, flow hierarchy, Scaling parameter for force-directed layoutĮrror with average weighted connectivity for digraphs, correct normalized laplacian with self-loops, load betweenness for single node graphs, isolated nodes missing from dfs/bfs trees, normalize HITS using l1, handle density of graphs with self loopsĬleaner handling of current figure status with Matplotlib, Pajek files now don’t write troublesome header line, default alpha value for GEXF files, read curved edges from yEd GraphMLįor full details of the issues closed for this release (added features and bug fixes) see: API changes #

More flexible weighted projection of bipartite graphsįaster topological sort, descendants and ancestors of DAGs NetworkX 1.8 #įaster (linear-time) graphicality tests and Havel-Hakimi graph generators Semiconnected graph and tree recognition algorithmsīugfix release for missing files in source packaging. Linear algebra package changed to use SciPy sparse matricesĪlgebraic connectivity, Fiedler vector, spectral ordering algorithms Highlights #Ĭompletely rewritten maximum flow and flow-based connectivity algorithms with Support for Python 3.1 is dropped in this release. Transitive closure, triadic census and antichainsīugfix release for minor installation and documentation issues. Kanesky’s algorithm for cut sets and k_components New generators for multipartite graphs, nonisomorphic trees,Īllow graph subclasses to use dict-like objects in place of dictsĭata keyword in G.edges() allows requesting edge attribute directlyĮxpanded layout flexibility for node subsets New generators related to expander graphs. Pyparsing dependence removed from GML reader/parser Hopcraft–Karp algorithm for maximum matchings Immediate_dominators, harmonic_centrality Highlights #Ĭonnected components now return generatorsĮnumerate_all_cliques, greedy_coloring, edge_dfs, find_cycle Support for Python 2.6 is dropped in this release. Restores default center and scale of layout routines.įixes various docs including no symbolic links in examples.ĭocs can now build using autosummary on. Highlights #įixes installation on some machines and test with appveyor. Support for Python 3.5 added, drop support for Python 3.2. Support for Python 3.6 added, drop support for Python 3.3. This is the last release to support Python 2. This is the last release to support Python 3.5.