PR Review: Algorithm to get IN and OUT component of a directed graph

8 views
Skip to first unread message

Salman Faris

unread,
Jul 19, 2021, 10:33:45 PM7/19/21
to networkx-discuss
Hi NetworkX community,

Can someone please review a PR I've made 10 days ago: https://github.com/networkx/networkx/pull/4969.

I have added functions to extract the IN and OUT components of a directed graph (that contains a strongly connected component) using a simple random-start BFS. The IN and OUT components are those as described in this paper by Broder et al. and is crucial in extracting the Bowtie diagram structure of a graph.

Thanks,
Sal
Reply all
Reply to author
Forward
0 new messages