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
- URL
- https://hal.science/hal-01095533
- URN
- urn:oai:HAL:hal-01095533v2
- Origin repository
- UNICA