Use @require and other decorators to simplify code imports/checking
Return matrix instead of array for laplacian functions
Whitespace cleanup and formatting
Refector conditional so there is only one return
Fix katz centrality doctest formatting
Fix core tests

Adjust test graph to map nodes since the new havel hakimi algorithm generates different node ordering
Merge pull request #876 from hagberg/core-tests

Fix core tests
Merge pull request #877 from hagberg/katz-test

Fix katz centrality doctest formatting
Merge pull request #833 from hagberg/laplaican-matrix

Laplaican matrix functions should return matrix
Fix import error and typos in scc tests
Remove failing threshold graph test

Need to rework for matrix type return from laplacian_matrix
Merge pull request #882 from hagberg/threshold-test

Threshold test
single_source_dijkstra_path passes cutoff
Merge pull request #883 from tdihp/patch-2

single_source_dijkstra_path passes cutoff
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
Allow larger number of neighbors in watts_strogatz_graph and newman_watts_strogatz_graph

previously the code

import networkx as nx
nx.watts_strogatz_graph(10,6,0.0)

would give the following error:

networkx.exception.NetworkXError: k>=n/2, choose smaller k or larger n

However, it should yield a ring network, with every node attached to 6
neighbors.

In order to obtain this, we now also need to check that we only rewire
an edge starting at a node, if the degree of that node is less than
n-1.  This avoids an infinite loop in the rewiring algorithm.
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.