<p>I am looking for an algorithm for computing the biconnected components of a strongly connected directed graph.</p>

CC BY-SA 3.0
2013-06-01T22:54:57.693Z
Have you checked [Wikipedia](http://en.wikipedia.org/wiki/Biconnected_component)? ps: have you read our [FAQ]?
Kaveh
CC BY-SA 3.0
2013-06-02T00:24:46.217Z
The Wikipedia article you link to is only about undirected graphs, so it doesn't answer Yossi's question.
David Eppstein
CC BY-SA 3.0
2013-06-02T01:20:12.037Z
@David, I see. Does biconnected component in the case of directed graphs mean that the graph will remain *strongly* connected after the removal of any vertex from the component?
Kaveh
CC BY-SA 3.0
2013-06-02T03:47:50.843Z
That's what I would guess, and a search of Google scholar for "k-strongly-connected" finds some sources using that definition, but other sources using an edge connectivity version in which each nontrivial subset of the vertices has at least k incoming edges.
David Eppstein
<ds.algorithms><graph-theory><graph-algorithms>
Biconnected components of a directed graph?
Yossi Gil
# Biconnected components of a directed graph?

(Asked by: username_0 on 2013-06-01)

I am looking for an algorithm for computing the biconnected components of a strongly connected directed graph.

**Tags:** ds.algorithms, graph-theory, graph-algorithms

> **Comments:**
> **username_1**: Have you checked [Wikipedia](http://en.wikipedia.org/wiki/Biconnected_component)? ps: have you read our [FAQ]?  
> **username_2**: The Wikipedia article you link to is only about undirected graphs, so it doesn't answer Yossi's question.  
> **username_1**: @David, I see. Does biconnected component in the case of directed graphs mean that the graph will remain *strongly* connected after the removal of any vertex from the component?  
> **username_2**: That's what I would guess, and a search of Google scholar for "k-strongly-connected" finds some sources using that definition, but other sources using an edge connectivity version in which each nontrivial subset of the vertices has at least k incoming edges.  

---

## 0 answers

