R implementation of Tarjan's algorithm for finding Strongly Connected Components in a digraph by Depth-First Search
-
Updated
Nov 15, 2021 - R
R implementation of Tarjan's algorithm for finding Strongly Connected Components in a digraph by Depth-First Search
Community Detection Analysis in Word Association Network using igraph R Library
Add a description, image, and links to the strongly-connected-components topic page so that developers can more easily learn about it.
To associate your repository with the strongly-connected-components topic, visit your repo's landing page and select "manage topics."