5.2 Graph computations

These functions are used to make standard computations on graphs.

articul

finds one or more articulation points

best_match

best matching of a graph

circuit

finds a circuit or the rank function in a directed graph

con_nodes

set of nodes of a connected component

connex

connected components

cycle_basis

basis of cycle of a simple undirected graph

find_path

finds a path between two nodes

girth

girth of a directed graph

graph_center

center of a graph

graph_complement

complement of a graph

graph_diameter

diameter of a graph

graph_power

kth power of a directed 1-graph

hamilton

hamiltonian circuit of a graph

is_connex

connectivity test

max_clique

maximum clique of a graph

min_weight_tree

minimum weight spanning tree

neighbors

nodes connected to a node

nodes_degrees

degrees of the nodes of a graph

perfect_match

min-cost perfect matching

predecessors

tail nodes of incoming arcs of a node

shortest_path

shortest path

strong_con_nodes

set of nodes of a strong connected component

strong_connex

strong connected components

successors

head nodes of outgoing arcs of a node

trans_closure

transitive closure