Two implementations of the algorithm, which is the foundation of the Collatz conjecture: One for double integers that is used for data analysis and the other for arbitrary large integers.
-
Updated
May 9, 2017 - R
Two implementations of the algorithm, which is the foundation of the Collatz conjecture: One for double integers that is used for data analysis and the other for arbitrary large integers.
R implementation of Tarjan's algorithm for finding Strongly Connected Components in a digraph by Depth-First Search
Add a description, image, and links to the digraph topic page so that developers can more easily learn about it.
To associate your repository with the digraph topic, visit your repo's landing page and select "manage topics."