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
Interpretive Structural Modelling (ISM). Returns a minimum-edge hierarchical digraph following J.N. Warfield's graph partitioning algorithm.
Add a description, image, and links to the block-triangular-matrix topic page so that developers can more easily learn about it.
To associate your repository with the block-triangular-matrix topic, visit your repo's landing page and select "manage topics."