NetworkX

Table Of Contents

Previous topic

Algorithms

Next topic

degree_assortativity_coefficient

Assortativity

Assortativity

degree_assortativity_coefficient(G[, x, y, ...]) Compute degree assortativity of graph.
attribute_assortativity_coefficient(G, attribute) Compute assortativity for node attributes.
numeric_assortativity_coefficient(G, attribute) Compute assortativity for numerical node attributes.
degree_pearson_correlation_coefficient(G[, ...]) Compute degree assortativity of graph.

Average neighbor degree

average_neighbor_degree(G[, source, target, ...]) Returns the average degree of the neighborhood of each node.

Average degree connectivity

average_degree_connectivity(G[, source, ...]) Compute the average degree connectivity of graph.
k_nearest_neighbors(G[, source, target, ...]) Compute the average degree connectivity of graph.

Mixing

attribute_mixing_matrix(G, attribute[, ...]) Return mixing matrix for attribute.
degree_mixing_matrix(G[, x, y, weight, ...]) Return mixing matrix for attribute.
degree_mixing_dict(G[, x, y, weight, nodes, ...]) Return dictionary representation of mixing matrix for degree.
attribute_mixing_dict(G, attribute[, nodes, ...]) Return dictionary representation of mixing matrix for attribute.