adj_matrix(G[, nodelist, weight]) |
Return adjacency matrix of G. |
adjacency_matrix(G[, nodelist, weight]) |
Return adjacency matrix of G. |
adjacency_spectrum(G[, weight]) |
Return eigenvalues of the adjacency matrix of G. |
algebraic_connectivity(G[, weight, ...]) |
Return the algebraic connectivity of an undirected graph. |
attr_matrix(G[, edge_attr, node_attr, ...]) |
Returns a NumPy matrix using attributes from G. |
attr_sparse_matrix(G[, edge_attr, ...]) |
Returns a SciPy sparse matrix using attributes from G. |
directed_laplacian_matrix(G[, nodelist, ...]) |
Return the directed Laplacian matrix of G. |
directed_modularity_matrix(G[, nodelist, weight]) |
Return the directed modularity matrix of G. |
fiedler_vector(G[, weight, normalized, tol, ...]) |
Return the Fiedler vector of a connected undirected graph. |
incidence_matrix(G[, nodelist, edgelist, ...]) |
Return incidence matrix of G. |
laplacian_matrix(G[, nodelist, weight]) |
Return the Laplacian matrix of G. |
laplacian_spectrum(G[, weight]) |
Return eigenvalues of the Laplacian of G |
modularity_matrix(G[, nodelist, weight]) |
Return the modularity matrix of G. |
modularity_spectrum(G) |
Return eigenvalues of the modularity matrix of G. |
normalized_laplacian_matrix(G[, nodelist, ...]) |
Return the normalized Laplacian matrix of G. |
spectral_ordering(G[, weight, normalized, ...]) |
Compute the spectral_ordering of a graph. |