diff options
| author | Jarrod Millman <jarrod.millman@gmail.com> | 2019-10-12 18:00:50 -0700 |
|---|---|---|
| committer | Jarrod Millman <jarrod.millman@gmail.com> | 2019-10-12 18:00:50 -0700 |
| commit | 7c0ee189e011f0ed1393c2a22aae0478bb5169ea (patch) | |
| tree | 0fb97f6ddfa356f99e870c9391ae1839bc41cce7 /README.rst | |
| parent | 7732299725e485a0268ec7007a550429d631a35e (diff) | |
| download | networkx-7c0ee189e011f0ed1393c2a22aae0478bb5169ea.tar.gz | |
Update README
Diffstat (limited to 'README.rst')
| -rw-r--r-- | README.rst | 26 |
1 files changed, 13 insertions, 13 deletions
@@ -25,19 +25,6 @@ of complex networks. - **Source:** https://github.com/networkx/networkx - **Bug reports:** https://github.com/networkx/networkx/issues -Install -------- - -Install the latest version of NetworkX:: - - $ pip install networkx - -Install with all optional dependencies:: - - $ pip install networkx[all] - -For additional details, please see `INSTALL.rst`. - Simple example -------------- @@ -54,6 +41,19 @@ Find the shortest path between two nodes in an undirected graph: >>> nx.shortest_path(G, 'A', 'D', weight='weight') ['A', 'B', 'D'] +Install +------- + +Install the latest version of NetworkX:: + + $ pip install networkx + +Install with all optional dependencies:: + + $ pip install networkx[all] + +For additional details, please see `INSTALL.rst`. + Bugs ---- |