Graph loop detection in Go using Tarjan's algorithm
-
Updated
Dec 7, 2021 - Go
Graph loop detection in Go using Tarjan's algorithm
🚪 Find the entry points in a set of JavaScript files.
Coq formalization of algorithms due to Tarjan and Kosaraju for finding strongly connected graph components using Mathematical Components and SSReflect [maintainers=@CohenCyril,@palmskog]
Advance algorithm implementations
Examples of intrusive container templates in C++.
Strongly Connected Components of a Graph