Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Credits, news, release info #908

Merged
merged 2 commits into from
Jul 22, 2013
Merged

Credits, news, release info #908

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
e46378e
Add news and credits for networkx-1.8 release
hagberg Jul 21, 2013
9f39777
Merge remote-tracking branch 'upstream/master' into credits-news-release
hagberg Jul 22, 2013
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
14 changes: 14 additions & 0 deletions doc/source/reference/api_1.8.rst
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
*********************************
Version 1.8 notes and API changes
*********************************

This page reflects API changes from networkx-1.7 to networkx-1.8.

Please send comments and questions to the networkx-discuss mailing list:
http://groups.google.com/group/networkx-discuss .

* Laplacian functions now all return matrices. To get a numpy array from a matrix use L = nx.laplacian_matrix(G).A

* Cycles


9 changes: 6 additions & 3 deletions doc/source/reference/credits.rst
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -84,6 +84,9 @@ Thanks especially to the following contributors:
- Nick Mancuso wrote the approximation algorithms for dominating set,
edge dominating set, independent set, max clique, and min-weighted
vertex cover.
- Alejandro Weinstein contributed the directed Laplacian function
- Mathieu Larose speed up the topological sort algorithms
- Dustin Smith conrtributed the dict to numpy array functions
- Brian Cloteaux contributed the linear-time graphicality tests and Havel-Hakimi graph generators
- Alejandro Weinstein contributed the directed Laplacian code
- Dustin Smith wrote the dictionary to numpy array function
- Mathieu Larose sped up the topological sort code
- Vincent Gauthier contributed the Katz centrality algorithm
- Sérgio Nery Simões developed the code for finding all simple paths
25 changes: 13 additions & 12 deletions doc/source/reference/news.rst
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,19 +4,22 @@
Release Log
===========

<<<<<<< HEAD

Networkx-1.8
------------
Release date: xx Jan 2013

New Features
~~~~~~~~~~~~

- Functions to generate all simple paths,

- Directed Laplacian
Release date: xx July 2013

- Improved shapefile reader, more flexible weighted projection of bipartite graphs, faster topological sort, decendents and ancestors of DAGs, scaling parameter for force-directed layout

Highlights
~~~~~~~~~~
- Faster (linear-time) graphicality tests and Havel-Hakimi graph generators
- Directed Laplacian matrix generator
- Katz centrality algorithm
- Functions to generate all simple paths
- Improved shapefile reader
- More flexible weighted projection of bipartite graphs
- Faster topological sort, decendents and ancestors of DAGs
- Scaling parameter for force-directed layout

Bug Fixes
---------
Expand All @@ -25,7 +28,6 @@ Bug Fixes
- Cleaner 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



For full details of the issues closed for this release (added features and bug fixes) see: https://github.com/networkx/networkx/issues?milestone=1&page=1&state=closed


Expand All @@ -34,7 +36,6 @@ API Changes
See :doc:`api_1.8`



Networkx-1.7
------------
Release date: 4 July 2012
Expand Down