diff options
| author | aric <none@none> | 2009-06-03 19:02:14 +0000 |
|---|---|---|
| committer | aric <none@none> | 2009-06-03 19:02:14 +0000 |
| commit | 03d6d8fc93b67477badddc8a04547d3540141286 (patch) | |
| tree | d0cf210493c74c54d2d64c1b8de18c386443fe2c /networkx/convert.py | |
| parent | b778ae1739711590fe7583bde8eca3a01ca0e45b (diff) | |
| download | networkx-03d6d8fc93b67477badddc8a04547d3540141286.tar.gz | |
Fix bad indent that cases error in converting to Graphs from dictionaries
(and other Graphs/DiGraphs).
--HG--
extra : convert_revision : svn%3A3ed01bd8-26fb-0310-9e4c-ca1a4053419f/networkx/trunk%401201
Diffstat (limited to 'networkx/convert.py')
| -rw-r--r-- | networkx/convert.py | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/networkx/convert.py b/networkx/convert.py index 5d1fb7a5..3e82ca9c 100644 --- a/networkx/convert.py +++ b/networkx/convert.py @@ -373,7 +373,7 @@ def from_dict_of_dicts(d,create_using=None,multigraph_input=False): for v,data in nbrs.iteritems(): if v not in seen: G.add_edge(u,v,data) - seen.add(u) + seen.add(u) return G def to_edgelist(G,nodelist=None): |