Force-directed graph layout using velocity Verlet integration.
Find strongly connected components of a directed graph using Tarjan's algorithm.
Computes strongly connected components of a directed graph
Finds all elementary circuits of a directed graph using Johnson's algorithm (1975)