diff options
| author | Dan Schult <dschult@colgate.edu> | 2015-06-17 09:22:17 -0400 |
|---|---|---|
| committer | Dan Schult <dschult@colgate.edu> | 2015-06-17 09:22:17 -0400 |
| commit | 8762d5cca44e68e4795ef4d74c220768077a6e97 (patch) | |
| tree | 1e3b44bd24a85a501d88c681edb3a9e1f7c027aa /networkx/classes/function.py | |
| parent | 675e2567c2a9e2ec0825ecf5e668edacdf35c4e8 (diff) | |
| parent | 902e221ae7b9e8c32489afcfdc815c2839342249 (diff) | |
| download | networkx-8762d5cca44e68e4795ef4d74c220768077a6e97.tar.gz | |
Merge pull request #1589 from MridulS/succprediter
Remove successors_iter() and predecessors_iter(). G.successors() and G.predecessors() now return iterators instead of lists
Diffstat (limited to 'networkx/classes/function.py')
| -rw-r--r-- | networkx/classes/function.py | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/networkx/classes/function.py b/networkx/classes/function.py index ed3a93c1..8e7c62b2 100644 --- a/networkx/classes/function.py +++ b/networkx/classes/function.py @@ -437,8 +437,8 @@ def all_neighbors(graph, node): Iterator of neighbors """ if graph.is_directed(): - values = itertools.chain.from_iterable([graph.predecessors_iter(node), - graph.successors_iter(node)]) + values = itertools.chain.from_iterable([graph.predecessors(node), + graph.successors(node)]) else: values = graph.neighbors(node) |