udpate News and Credits for networkx-0.37networkx-0.37

--HG--
extra : convert_revision : svn%3A3ed01bd8-26fb-0310-9e4c-ca1a4053419f/networkx/trunk%40836

3 files changed, 56 insertions, 4 deletions

diff --git a/doc/Credits.txt b/doc/Credits.txt
index d23863a8..7af3d601 100644
--- a/doc/Credits.txt
+++ b/doc/Credits.txt
@@ -9,7 +9,8 @@ Thanks to David Eppstein for the idea of representing a graph G
 so that "for n in G" loops over the nodes in G and G[n] are node n's 
 neighbors.      
 
-Thanks to the following people who have made contributions to NetworkX:
+Thanks to everyone for making contributions to NetworkX including the 
+following and many more:  
 
  - Katy Bold contributed the Karate Club graph 
 
@@ -22,7 +23,8 @@ Thanks to the following people who have made contributions to NetworkX:
 
  - Holly Johnsen helped fix the path based centrality measures 
 
- - Arnar Flatberg fixed the graph laplacian routines
+ - Arnar Flatberg fixed the graph laplacian routines and submitted
+   bug reports and fixes
 
  - Chris Myers suggested using None as a default datatype, suggested
    improvements for the IO routines, added grid generator index tuple
@@ -49,4 +51,16 @@ Thanks to the following people who have made contributions to NetworkX:
  - Eben Kennah contributed the strongly connected components and
    DFS functions.
 
-- Sasha Gutfriend contributed edge betweenness algorithms
+ - Sasha Gutfriend contributed edge betweenness algorithms
+
+ - Joris van Rantwijk wrote the maximum-weight matching code
+
+ - Andrew Conway suggested the Ubigraph module and contributed 
+   the initial code
+
+ - Charles Duffy submitted patches to improve topological sorting
+
+
+ 
+
+  
diff --git a/doc/News.txt b/doc/News.txt
index ea69fba9..01fe8da4 100644
--- a/doc/News.txt
+++ b/doc/News.txt
@@ -3,6 +3,44 @@
 NetworkX News
 =============
 
+NetworkX-0.37
+---------------
+
+Release date: 17 August 2008
+
+See: https://networkx.lanl.gov/timeline
+
+NetworkX now requires Python 2.4 or later for full functionality.
+
+New features
+~~~~~~~~~~~~
+ - Edge coloring and node line widths with Matplotlib drawings
+ - Update pydot functions to work with pydot-1.0.2
+ - Maximum-weight matching algorithm
+ - Ubigraph interface for 3D OpenGL layout and drawing
+ - Pajek graph file format reader and writer
+ - p2g graph file format reader and writer
+ - Secondary sort in topological sort
+
+Bug fixes
+~~~~~~~~~
+ - Better edge data handling with GML writer 
+ - Edge betweenness fix for XGraph with default data of None
+ - Handle Matplotlib version strings (allow "pre")
+ - Interface to PyGraphviz (to_agraph()) now handles parallel edges
+ - Fix bug in copy from XGraph to XGraph with multiedges
+ - Use SciPy sparse lil matrix format instead of coo format 
+ - Clear up ambiguous cases for Barabasi-Albert model
+ - Better care of color maps with Matplotlib when drawing colored nodes
+   and edges 
+ - Fix error handling in layout.py
+
+Examples
+~~~~~~~~
+ - Ubigraph examples showing 3D drawing at 
+   https://networkx.lanl.gov/browser/networkx/trunk/doc/examples/ubigraph
+
+
 NetworkX-0.36
 ---------------
 
diff --git a/networkx/graph.py b/networkx/graph.py
index 1183e9ee..65a214c7 100644
--- a/networkx/graph.py
+++ b/networkx/graph.py
@@ -56,7 +56,7 @@ will add new nodes as required.
 
 """
 __author__ = """Aric Hagberg (hagberg@lanl.gov)\nPieter Swart (swart@lanl.gov)\nDan Schult(dschult@colgate.edu)"""
-#    Copyright (C) 2004-206 by 
+#    Copyright (C) 2004-2008 by 
 #    Aric Hagberg <hagberg@lanl.gov>
 #    Dan Schult <dschult@colgate.edu>
 #    Pieter Swart <swart@lanl.gov>