This repository is all about various concepts related to graph and tree. It also contains solutions to problems from various online judges, organized by topic.

Rader's algorithm, which is introduced in Kepner11, finds for any graph, represented by its adjacency matrix A, its SCC. The algorithm relies on a known relationship in linear algebra, given in ...

Abstract: The problem of decomposing a directed graph into its strongly connected components is a fundamental graph problem inherently present in many scientific and commercial applications. In this ...