21d6cb69f8
NetworkX 2.5 Highlights ---------- This release is the result of 10 months of work with over 200 commits by 92 contributors. Highlights include: - Dropped support for Python 3.5. - add Pathlib support to work with files. - improve performance. - Updated docs and tests. - Removed code designed to work with Python 2. New Functions: - lukes_partitioning - triadic analysis functions - functions for trophic levels analysis - d_separated - is_regular and other regular graph measures - graph_hash using Weisfeiler Lehman methods - common_neighbor_centrality (CCPA link prediction) - max_weight_clique - path_weight and is_path - rescale_layout_dict - junction_tree New generators: - paley_graph - interval_graph New layouts: - multipartite_layout Improvements ------------ - Add governance documents, developer guide and community structures - Implement explicit deprecation policy. - Initiate an NX Enhancement Proposal (NXEP) system - optimize single_source_shortest_path - improved consistent "weight" specification in shortest_path routines - Reduce numpy.matrix usage which is discouraged by numpy. - improved line color - better search engine treatment of docs - lattice and grid_graph and grid_2d_graph can use dim=tuple - fix initializer of kamada_kawai_layout algorithm - moral and threshold functions now included in namespace and docs - scale arrows better when drawing - more uniform creation of random lobster graphs - allow editing graph during iteration over connected_components - better column handling in coversion of pandas DataFrame - allow simrank_similarity with directed graph input - ensure VoteRank ability is nonnegative - speedup kernighan_lin_bisection - speedup negative weight cycle detection - tree_isomorphism - rooted_tree_isomorphism - Gexf edge attribute "label" is available API Changes ----------- - enabled "copy" flag parameter in `contracted_nodes` - allow partially periodic lattices - return value for minimum_st_node_cut now always a set - removed unused "has_numpy" argument from create_py_random_state - fixed return values when drawing empty nodes and edges - allow sets and frozensets of edges as input to nx.Graph() - "weight" can be function for astar, directional_dijksta, all_shortest_path - allow named key ids for GraphML edge writing - all keywords are now checked for validity in nx.draw and friends - EdgeDataView "in" operator checks if nodes are "in nbunch" - remove completeness condition from minimum weight full matching - option to sort neighbors in bfs traversal - draw_networkx accepts numpy array for edgelist - relabel_nodes with 2 nodes mapped to same node can now create multiedge - steiner_tree works with MultiGraph - Add `show` kwarg to view_pygraphviz - Prepare for turning chordal_graph_cliques into a generator - GraphML reader keyword force_multigraph creates MultiGraph even w/o multiedges |
||
|---|---|---|
| .. | ||
| patches | ||
| DESCR | ||
| distinfo | ||
| Makefile | ||
| PLIST | ||