summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authoraric <none@none>2006-11-10 04:47:53 +0000
committeraric <none@none>2006-11-10 04:47:53 +0000
commit1846792ba2e5ac29f7c3b6354f570aede1267f6b (patch)
treeb7b4ba14e8996c804072a5ead7cc1e87294b51d8
parent2e5be48a8f363b873e1124ac8e1353203a9e61a7 (diff)
downloadnetworkx-1846792ba2e5ac29f7c3b6354f570aede1267f6b.tar.gz
update Quick_ref and Readme for numpy instead of Numeric usage
--HG-- extra : convert_revision : svn%3A3ed01bd8-26fb-0310-9e4c-ca1a4053419f/networkx/trunk%40440
-rw-r--r--doc/Quick_ref.txt6
-rw-r--r--doc/Readme.txt5
2 files changed, 5 insertions, 6 deletions
diff --git a/doc/Quick_ref.txt b/doc/Quick_ref.txt
index cb895ae0..4fee9836 100644
--- a/doc/Quick_ref.txt
+++ b/doc/Quick_ref.txt
@@ -186,9 +186,9 @@ Functions
kl_connected_subgraph(G) - subgraph of G that is kl-connected.
is_kl_connected(G) - True if G is kl-connected.
- adj_matrix(G) - adjacency matrix for G as a Numeric array.
- laplacian(G) - Graph Laplacian for G as a Numeric array.
- generalized_laplacian(G) - generalized graph Laplacian for G as a Numeric array.
+ adj_matrix(G) - adjacency matrix for G as a numpy matrix.
+ laplacian(G) - Graph Laplacian for G as a numpy matrix
+ generalized_laplacian(G) - generalized graph Laplacian for G as a numpy matrix.
is_directed_acyclic_graph(G) - True if DAG.
topological_sort(G) - list of nodes in directed graph such that every edge goes from left to right.
diff --git a/doc/Readme.txt b/doc/Readme.txt
index 942d0b94..7f3133ab 100644
--- a/doc/Readme.txt
+++ b/doc/Readme.txt
@@ -65,10 +65,9 @@ Requirements
Optional packages to enable drawing networks:
- Matplotlib http://matplotlib.sourceforge.net/
- - Pygraphviz http://networkx.lanl.gov/pygraphviz/
+ - pygraphviz http://networkx.lanl.gov/pygraphviz/
- Graphviz http://graphviz.org/
- - Pydot http://www.dkbza.org/pydot.html
- - numpy or Numeric http://numeric.scipy.org/
+ - numpy http://numpy.scipy.org/
Optional useful packages: