Pure JS implementation of CRC32 https://en.wikipedia.org/wiki/Cyclic_redundancy_check
Find strongly connected components of a directed graph using [Tarjan's algorithm](https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm).
Pure JS implementation of CRC32-C https://en.wikipedia.org/wiki/Cyclic_redundancy_check