bf6b202b96
2.4: This release is the result of 6 months of work with over 200 commits by 67 contributors. Highlights include: - Remove deprecated code from 1.x - Support for Python 3.8 - Switched to pytest for testing - Last release to support Python 3.5 New Functions: - barycenter functions - Bethe Hessian matrix function - Eulerian Path methods - group centrality measures - subgraph monomorphisms - k-truss algorithms - onion decomposition - resistance distance - asteroidal triples - non-randomness measures - linear prufing - minimum weight bipartite matching - Incremental closeness centrality - ISMAGS subgraph isomorphism algorithm - create chordal graph of a graph New generators - Binomial tree generator - Directed joint degree generator - Random internet AS graph generator New for Layouts - spiral node layout routine - support for 3d layouts Improvements ------------ - allow average shortest path to use Floyd-Warshall method - improve read/write of GML, GEXF, GraphML - allow string or json object as input to jit_graph - attempt to allow numpy.array input in place of lists in more places - faster strongly connected components - faster Floyd-Warshall Optimization - faster global efficiency - faster transitive closure - fix unionfind; betweenness_subset; lexico-topo-sort; A*; inverse_line_graph; async label propagation; edgelist reading; Gomory-Hu flow method; label_propagation; partial_duplication; shell_layout with 1 node in shell; from_pandas_edgelist - Documentation improvement and fixes API Changes ----------- A utility function is_list_of_ints became is_bunch_of_ints and now tests int(item)==item instead of isinstance(_, int) This allows e.g. floats whose values are integer. Added utility make_list_of_ints to convert containers of integer values to lists of integers Deprecations ------------ Removed functions (marked as deprecated in NetworkX 2.1): - attracting_component_subgraphs - connected_component_subgraphs - weakly_connected_component_subgraphs - strongly_connected_component_subgraphs - biconnected_component_subgraphs - See docs for component functions for how to get subgraphs. Graph Object methods removed (marked as deprecated 2.1) - G.add_path - G.add_cycle - G.add_star - G.nodes_with_selfloops - G.number_of_selfloops - G.selfloop_edges - These are now NetworkX functions, e.g. nx.add_star(G, 5) - G.node --> use G.nodes - G.fresh_copy --> use G.__class__ Remove old names for graphview functions. - ReverseView - SubGraph - SubMultiGraph - SubMultiDiGraph - SubDiGraph - GraphView - DiGraphView - MultiGraphView - MultiDiGraphView - MultiReverseView - Use reverse_view, subgraph_view and generic_graph_view.
21 lines
615 B
Makefile
21 lines
615 B
Makefile
# $NetBSD: Makefile,v 1.31 2020/04/11 07:45:41 adam Exp $
|
|
|
|
DISTNAME= networkx-2.4
|
|
PKGNAME= ${PYPKGPREFIX}-${DISTNAME}
|
|
CATEGORIES= math python
|
|
MASTER_SITES= ${MASTER_SITE_PYPI:=n/networkx/}
|
|
|
|
MAINTAINER= pkgsrc-users@NetBSD.org
|
|
HOMEPAGE= https://networkx.github.io/
|
|
COMMENT= Python package for creating and manipulating graphs and networks
|
|
LICENSE= modified-bsd
|
|
|
|
DEPENDS+= ${PYPKGPREFIX}-decorator>=4.3.0:../../devel/py-decorator
|
|
TEST_DEPENDS+= ${PYPKGPREFIX}-nose>=1.3.7:../../devel/py-nose
|
|
|
|
USE_LANGUAGES= # none
|
|
|
|
PYTHON_VERSIONS_INCOMPATIBLE= 27
|
|
|
|
.include "../../lang/python/egg.mk"
|
|
.include "../../mk/bsd.pkg.mk"
|