Skip to main content

biconnected_components

docs-source

Abstract#

Finding biconnected components means finding a maximal biconnected subgraph. Subgraph is biconnected if:

  • It is possible to go from each node to another within a biconnected subgraph
  • First scenario remains true even after removing any vertex in the subgraph

The algorithm works by finding articulation points, and then traversing from these articulation points toward other nodes, which all together form one biconnected component.

TraitValue
Module typealgorithm
ImplementationC++
Graph directionundirected
Edge weightsunweighted
Parallelismsequential

Procedures#

get()#

Output:#

  • bcc_id ➡ Biconnected component identifier. There is no order of nodes within one biconnected component.
  • node_from ➡ First node of an edge contained in biconnected component.
  • node_to ➡ Second node of an edge contained in biconnected component

Usage:#

CALL biconnected_components.get()YIELD bcc_id, node_from, node_to;

Example#