This is the documentation for the current state of the development branch of rustworkx. The documentation or APIs here can change prior to being released.

Other Algorithm Functions#

rustworkx.adjacency_matrix(graph[, ...])

Return the adjacency matrix for a graph object


Compute the transitivity of a graph.


Return the core number for each node in the graph.

rustworkx.graph_line_graph(graph, /)

Constructs the line graph of a PyGraph object.

rustworkx.metric_closure(graph, weight_fn, /)

Return the metric closure of a graph

rustworkx.is_planar(graph, /)

Check if an undirected graph is planar.


Calculates the relational coarsest partition otherwise known as the maximum bisimulation relation using the Paige-Tarjan algorithm described in "Three partition refinement algorithms".