summaryrefslogtreecommitdiff
path: root/doc/reference
diff options
context:
space:
mode:
authorJarrod Millman <jarrod.millman@gmail.com>2018-11-03 00:39:32 -0700
committerJarrod Millman <jarrod.millman@gmail.com>2018-11-14 18:49:11 -0800
commitc19b4bc99704bce370192d5daa2eb182ea809ee5 (patch)
treeafdccb4f14a9c52fb42b6842632820d3c28eea07 /doc/reference
parente835fe3163ee56f3e53b0adb55f35e6187b37681 (diff)
downloadnetworkx-c19b4bc99704bce370192d5daa2eb182ea809ee5.tar.gz
Fix doctests
Diffstat (limited to 'doc/reference')
-rw-r--r--doc/reference/introduction.rst2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/reference/introduction.rst b/doc/reference/introduction.rst
index 6dd8cb2f..64182195 100644
--- a/doc/reference/introduction.rst
+++ b/doc/reference/introduction.rst
@@ -317,7 +317,7 @@ edges $(A, B)$ and $(B, C)$.
>>> G.add_edge('A', 'B')
>>> G.add_edge('B', 'C')
>>> print(G.adj)
- {'A': {'B': {}}, 'C': {'B': {}}, 'B': {'A': {}, 'C': {}}}
+ {'A': {'B': {}}, 'B': {'A': {}, 'C': {}}, 'C': {'B': {}}}
The data structure gets morphed slightly for each base graph class.
For DiGraph two dict-of-dicts-of-dicts structures are provided, one