diff options
| author | Dan Schult <dschult@colgate.edu> | 2018-09-16 09:24:17 -0400 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2018-09-16 09:24:17 -0400 |
| commit | 6c7534a140a9b752037f4ce19bc89a934efa84be (patch) | |
| tree | 0ee0994275d377d2520756bf131e72cc5ff81940 /doc | |
| parent | 2942c0e2442aa7112eeee9a778a1a025f426cd07 (diff) | |
| download | networkx-6c7534a140a9b752037f4ce19bc89a934efa84be.tar.gz | |
Update release docs for v2.2 (#3161)
Diffstat (limited to 'doc')
| -rw-r--r-- | doc/release/release_dev.rst | 10 |
1 files changed, 9 insertions, 1 deletions
diff --git a/doc/release/release_dev.rst b/doc/release/release_dev.rst index a31ab4ab..6a4c7f43 100644 --- a/doc/release/release_dev.rst +++ b/doc/release/release_dev.rst @@ -17,6 +17,12 @@ Highlights This release is the result of X of work with over X pull requests by X contributors. Highlights include: +- Add support for Python 3.7. This is the last release to support Python 2. +- Uniform random number generator (RNG) handling which defaults to global + RNGs but allows specification of a single RNG for all random numbers in NX. +- Improved GraphViews to ease subclassing and remove cyclic references + which caused trouble with deepcopy and pickle. +- New Graph method `G.update(H)` Improvements ------------ @@ -55,7 +61,9 @@ New functions for tree width and tree decompositions. Functions for Clauset-Newman-Moore modularity-max community detection. -Functions for small world analysis, directed clustering and perfect matchings. +Functions for small world analysis, directed clustering and perfect matchings, +eulerizing a graph, depth-limited BFS, percolation centrality, +planarity checking. The shortest_path generic and convenience functions now have a `method` parameter to choose between dijkstra and bellmon-ford in the weighted case. |