Gabow

Finds the strongly connected components of a directed graph with one depth-first search and two stacks, without the lowlink values of Tarjan's algorithm.

Time complexity O(V+E), gograph function connectivity.Gabow.

How it works

Gabow's algorithm finds the strongly connected components in one depth-first search, as Tarjan's does, but without lowlink values. It keeps two stacks. The first holds the vertices the search has reached that aren't in a component yet. The second holds the vertices on the current path that could still be the first vertex of a component.

When an edge leads to a vertex still on the first stack, every vertex on the path after it is in the same component, so the second stack is popped back to it. When the search finishes a vertex that is still on top of the second stack, that vertex starts a component. The first stack is popped down to it, and those vertices form the component.

It costs O(V+E). On the same graph, Tarjan's and Gabow's algorithms find the same components in the same order. They differ only in how they tell that the search has finished one.

Linked web pages

Forty pages of a product website, P1 to P40, where P stands for page: the main site (P1 to P13), the blog (P14 to P19), landing pages (P20 to P24), the help center (P25 to P28), the docs (P29 to P38) and the status pages (P39 and P40). Each edge counts the links from one page to another. Only ads and emails lead to the landing pages, and the help center, docs and status pages never link back to the main site.

A directed, weighted graph with 40 vertices and 114 edges.

Which groups of pages can a visitor move around freely, getting from any page of a group to any other by following links?

The graph has 10 strongly connected components. The ones with more than one vertex are P29, P30, P31, P32, P33, P34, P35, P36, P37 and P38; P25, P26, P27 and P28; P39 and P40; P1, P2, P3, P4, P5, P6, P7, P8, P9, P10 and 8 more. The other 6 components have one vertex each: P19, P20, P21, P22, P23 and P24.

Step by step

  1. Gabow's path-based algorithm searches depth-first from each vertex no earlier search has reached, in the graph's vertex order, and numbers the vertices in the order it reaches them. Stack S holds every vertex reached but not yet placed in a component. Stack P holds the vertices on the search path that can still be the root of a component. An edge to a vertex still on S closes a cycle, so P loses every vertex numbered above that vertex. When a vertex finishes on top of P, it is the root of a component: it and the vertices above it on S form one strongly connected component.
  2. Start at P1, the first vertex. P1 gets number 0 and goes on S and P.
  3. Follow P1 to P2. P2 gets number 1 and goes on S and P.
  4. P2 has an edge to P1, which is still on S with number 0. That closes a cycle through P1, so every vertex on P numbered above 0 is in the same component as P1 and can't be its root. Pop P2 off P.
  5. Follow P2 to P3. P3 gets number 2 and goes on S and P.
  6. P3 has an edge to P1, which is still on S with number 0. That closes a cycle through P1, so every vertex on P numbered above 0 is in the same component as P1 and can't be its root. Pop P3 off P.

135 more steps lead to the last one:

  1. Done. Gabow found 10 strongly connected components, 6 of them with one vertex. Each component is listed after every component it has an edge into. Every vertex now shows the component it belongs to.

Use it in Go

for _, component := range connectivity.Gabow(g) {
	var names []string
	for _, v := range component {
		names = append(names, v.Label())
	}
	fmt.Println(strings.Join(names, ", "))
}

Example graphs

More in Connectivity

  • Tarjan: Finds the strongly connected components of a directed graph, the groups of vertices that can all reach each other, with one depth-first search.
  • Kosaraju: Finds the strongly connected components of a directed graph with two depth-first searches, the second on the graph with every edge reversed.
  • Condensation: Replaces each strongly connected component with one vertex. What is left is a DAG, so it can be sorted and scheduled.
  • Connected components: Splits a graph into its connected pieces, the groups of vertices joined to each other by some path, with one search per piece.
  • Cycle detection: Says whether a graph has a cycle, a way to follow its edges from a vertex back to the same vertex, and stops at the first one it finds.
  • Find a cycle: Returns the vertices of one cycle in order: the first one a depth-first search closes with an edge back to its search path.
  • Bridges and articulation points: Finds the edges and the vertices whose loss splits an undirected graph into more pieces, its single points of failure, from one depth-first search.

All algorithms