Crate retworkx[][src]

Structs

DAGHasCycle
DAGWouldCycle
InvalidNode
NoEdgeBetweenNodes
NoPathFound
NoSuitableNeighbors
NullGraph

Functions

PyInit_retworkx

This autogenerated function is called by the python interpreter when importing the module.

cycle_basis

Return a list of cycles which form a basis for cycles of a given PyGraph

digraph_dijkstra_shortest_paths

Find the shortest path from a node

digraph_distance_matrix

Get the distance matrix for a directed graph

digraph_find_cycle

Return the first cycle encountered during DFS of a given PyDiGraph, empty list is returned if no cycle is found

directed_gnm_random_graph

Return a :math:G_{nm} of a directed graph

directed_gnp_random_graph

Return a :math:G_{np} directed random graph, also known as an Erdős-Rényi graph or a binomial graph.

graph_dijkstra_shortest_paths

Find the shortest path from a node

graph_distance_matrix

Get the distance matrix for an undirected graph

is_matching

Check if matching is valid for graph

is_maximal_matching

Check if a matching is a maximal (not maximum) matching for a graph

is_weakly_connected

Check if the graph is weakly connected

max_weight_matching

Compute a maximum-weighted matching for a :class:~retworkx.PyGraph

strongly_connected_components

Compute the strongly connected components for a directed graph

undirected_gnm_random_graph

Return a :math:G_{nm} of an undirected graph

undirected_gnp_random_graph

Return a :math:G_{np} random undirected graph, also known as an Erdős-Rényi graph or a binomial graph.

weakly_connected_components

Find the weakly connected components in a directed graph