Install
Tutorial
Reference
Releases
Developer
Gallery
Guides
Home Page
GitHub
v2.7.1
devel (latest)
current (stable)
Introduction
Graph types
Algorithms
Functions
degree
degree_histogram
density
info
create_empty_copy
is_directed
to_directed
to_undirected
is_empty
add_star
add_path
add_cycle
subgraph
subgraph_view
induced_subgraph
restricted_view
reverse_view
edge_subgraph
nodes
number_of_nodes
neighbors
all_neighbors
non_neighbors
common_neighbors
edges
number_of_edges
density
non_edges
selfloop_edges
number_of_selfloops
nodes_with_selfloops
is_weighted
is_negatively_weighted
set_node_attributes
get_node_attributes
set_edge_attributes
get_edge_attributes
is_path
path_weight
freeze
is_frozen
Graph generators
Linear algebra
Converting to and from other data formats
Relabeling nodes
Reading and writing graphs
Drawing
Randomness
Exceptions
Utilities
Glossary
neighbors
¶
neighbors
(
G
,
n
)
[source]
¶
Returns a list of nodes connected to node n.