Published February 26, 2015 | Version v1
Publication

Formally-Proven Kosaraju's algorithm

Description

This notes explains how the Kosaraju's algorithm that computes the strong-connected components of a directed graph has been for-malised in the Coq prover using the SSReflect extension.

Additional details

Created:
March 25, 2023
Modified:
November 30, 2023