Merge pull request #908 from hagberg/credits-news-release

Credits, news, release info

doc/source/reference/api_1.8.rst

@@ -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
+
+

doc/source/reference/credits.rst

@@ -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

doc/source/reference/news.rst

@@ -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
 ---------
@@ -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
 
 
@@ -34,7 +36,6 @@ API Changes
 See :doc:`api_1.8`
 
 
-
 Networkx-1.7
 ------------
 Release date:  4 July 2012