Algorithms¶

Approximation
- Connectivity
- K-components
- Clique
- Clustering
- Dominating Set
- Independent Set
- Matching
- Ramsey
- Vertex Cover
Assortativity
- Assortativity
- Average neighbor degree
- Average degree connectivity
- Mixing
Bipartite
- Basic functions
- Matching
- Matrix
- Projections
- Spectral
- Clustering
- Redundancy
- Centrality
- Generators
Blockmodeling
- blockmodel
Boundary
- edge_boundary
- node_boundary
Centrality
- Degree
- Closeness
- Betweenness
- Current Flow Closeness
- Current-Flow Betweenness
- Eigenvector
- Communicability
- Load
- Dispersion
Chordal
- is_chordal
- chordal_graph_cliques
- chordal_graph_treewidth
- find_induced_nodes
Clique
- Cliques
- enumerate_all_cliques
- find_cliques
- make_max_clique_graph
- make_clique_bipartite
- graph_clique_number
- graph_number_of_cliques
- node_clique_number
- number_of_cliques
- cliques_containing_node
Clustering
- triangles
- transitivity
- clustering
- average_clustering
- square_clustering
Coloring
- greedy_color
Communities
- K-Clique
Components
- Connectivity
- Strong connectivity
- Weak connectivity
- Attracting components
- Biconnected components
- Semiconnectedness
Connectivity
- K-node-components
- K-node-cutsets
- Flow-based Connectivity
- Flow-based Minimum Cuts
- Stoer-Wagner minimum cut
- Utils for flow-based connectivity
Cores
- core_number
- k_core
- k_shell
- k_crust
- k_corona
Cycles
- Cycle finding algorithms
- cycle_basis
- simple_cycles
- find_cycle
Directed Acyclic Graphs
- ancestors
- descendants
- topological_sort
- topological_sort_recursive
- is_directed_acyclic_graph
- is_aperiodic
- transitive_closure
- antichains
- dag_longest_path
- dag_longest_path_length
Distance Measures
- center
- diameter
- eccentricity
- periphery
- radius
Distance-Regular Graphs
- Distance-regular graphs
- is_distance_regular
- intersection_array
- global_parameters
Dominance
- immediate_dominators
- dominance_frontiers
Dominating Sets
- dominating_set
- is_dominating_set
Eulerian
- is_eulerian
- eulerian_circuit
Flows
- Maximum Flow
- Edmonds-Karp
- Shortest Augmenting Path
- Preflow-Push
- Utils
- Network Simplex
- Capacity Scaling Minimum Cost Flow
Graphical degree sequence
- is_graphical
- is_digraphical
- is_multigraphical
- is_pseudographical
- is_valid_degree_sequence_havel_hakimi
- is_valid_degree_sequence_erdos_gallai
Hierarchy
- flow_hierarchy
Hybrid
- kl_connected_subgraph
- is_kl_connected
Isolates
- is_isolate
- isolates
Isomorphism
- is_isomorphic
- could_be_isomorphic
- fast_could_be_isomorphic
- faster_could_be_isomorphic
- Advanced Interface to VF2 Algorithm
Link Analysis
- PageRank
- Hits
Link Prediction
- resource_allocation_index
- jaccard_coefficient
- adamic_adar_index
- preferential_attachment
- cn_soundarajan_hopcroft
- ra_index_soundarajan_hopcroft
- within_inter_cluster
Matching
- Matching
- maximal_matching
- max_weight_matching
Minors
- contracted_edge
- contracted_nodes
- identified_nodes
- quotient_graph
Maximal independent set
- maximal_independent_set
Minimum Spanning Tree
- minimum_spanning_tree
- minimum_spanning_edges
Operators
- complement
- reverse
- compose
- union
- disjoint_union
- intersection
- difference
- symmetric_difference
- compose_all
- union_all
- disjoint_union_all
- intersection_all
- cartesian_product
- lexicographic_product
- strong_product
- tensor_product
- power
Rich Club
- rich_club_coefficient
Shortest Paths
- shortest_path
- all_shortest_paths
- shortest_path_length
- average_shortest_path_length
- has_path
- Advanced Interface
- Dense Graphs
- A* Algorithm
Simple Paths
- all_simple_paths
- shortest_simple_paths
Swap
- double_edge_swap
- connected_double_edge_swap
Traversal
- Depth First Search
- Breadth First Search
- Depth First Search on Edges
Tree
- Recognition
- Branchings and Spanning Arborescences
Triads
- triadic_census
Vitality
- closeness_vitality