Coding Practice

The "Rabbit Hole (Chapter 2)" question from Meta Careers:

It reminded me that there are some DFS based questions that are relatively tricky to code if you want to do them without using recursions.

dfs.cpp: just depth-first search
scc.cpp: compute strongly connected components using Kosaraju's algorithm (2 x dfs) and Tarjan's algorithm.
rabit_hole.cpp: a solution of the Rabbit Hole question (SCC + critical-path using topological sorting of DAG).

Rabbit Hole (Charpter 2)

Problem description:

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
README.md		README.md
dfs.cpp		dfs.cpp
rabit_hole.cpp		rabit_hole.cpp
scc.cpp		scc.cpp
screen.gif		screen.gif