kpriv/pkgsrc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
pkgsrc/math/py-networkx/distinfo

8 lines
467 B
Text
Raw Normal View History

py-networkx: updated to 2.5 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
2020-12-09 17:56:19 +01:00
$NetBSD: distinfo,v 1.16 2020/12/09 16:56:19 adam Exp $
Add math/py-networkx package.
2008-08-27 20:53:42 +02:00
py-networkx: updated to 2.5 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
2020-12-09 17:56:19 +01:00
SHA1 (networkx-2.5.tar.gz) = 439af030cbfdc2c4cbdef5dc423d5ea8e527d02a
RMD160 (networkx-2.5.tar.gz) = fd5549bc788c32e6d2681f2ec9d460b8d63b5f5d
SHA512 (networkx-2.5.tar.gz) = ab51198072d20bdba7c9ceb6856631a20a7e9527a7cadb41271a999f57bf60da5488269c6e4e1f3f4f33420ec6493af665386842c216ea1cfadd1792ccb6444e
Size (networkx-2.5.tar.gz) = 1542085 bytes
py-networkx: fix building; Python 2.7 is not supported
2019-09-25 09:24:12 +02:00
SHA1 (patch-setup.py) = 9859c3102492d4f9afd41533c3b1bf45cbc6850d
Reference in a new issue Copy permalink