Update credits and news
Force float in stochastic graph.
Test stochstic graph with ints
Doc, whitespace, formatting, style cleanup.
Don't copy subgraphs in cuthill_mckee_ordering().

The connected_component_subgraphs() function used in the cuthill_mckee_ordering() makes a copy.  That causes new node objects to be created which might not be desirable when returning a node ordering if the hash changes when a new object is created. Fix by not copying nodes when forming a subgraph of connected nodes.
Fix import error and typos in scc tests
Merge pull request #3 from hagberg/scc-import

Fix import error and typos in scc tests
Create nonrecursive function for simple_cycles

Copied simple_cycles to recursive_simple_cycles and added a new
simple_cycles that is the same algorithm but not recursive.  Two
changes in the API for simple_cycle are that
1) it now returns a generator instead of returning a list.
2) Cycles no longer repeat the first node as the last.  The last
node in the list is assumed to connect to the first node on the list.

Tests added to compare output of simple_cycles and recursive_simple_cycles

Thanks to erikasantos and friedsoap for instigating this and suggesting
helpful changes (which I incorporated).  This addresses #874 #888 #889
Fix documentation typos for clustering
Merge pull request #896 from loicseguin/clustering-doc

Fix documentation typos for clustering
Merge branch 'master' of https://github.com/networkx/networkx

* 'master' of https://github.com/networkx/networkx:
  Fix documentation typos for clustering
Revert cycles to repeat starting node at the end.
Slight speedup in simple_cycles.  Order differs from recursive now.

Popping nodes from the end instead of beginning gives a different order,
but still valid.  Cycles now are a cyclic permutation of those reported
by recursive routine.  This revealed holes in tests that are fixed here.
Merge branch 'pr/890'

* pr/890:
  Slight speedup in simple_cycles.  Order differs from recursive now.
  Revert cycles to repeat starting node at the end.
Merge pull request #890 from dschult/master

Non-recursive and faster simple_cycles
Format cycles from simple_cycles w/o last node

Cycles in networkx are represented by a list of nodes.  But
simple_cycles() repeated the last node of the cycle.  This removes
that repetition to bring simple_cycles in line with other cycle
routines.  Related discussion in #889, #890.

Also corrected some doctests and updated tests for this change.
is_directed_acyclic_graph now returns false on undirected graphs rather than raising NetworkXError.
Fix spacing
Merge pull request #897 from dschult/fix_cycles

Format cycles from simple_cycles w/o last node
Merge pull request #898 from calmofthestorm/is_directed_acyclic_fix

is_directed_acyclic_graph now returns false on undirected graphs rather ...