GitHub - MateusNogSantos/warshall-algorithm: The Warshall Algorithm is used to compute the transitive closure of a directed graph, determining which vertices are reachable from one another, either directly or indirectly.

Name		Name	Last commit message	Last commit date
warshall.cpp		warshall.cpp

About

The Warshall Algorithm is used to compute the transitive closure of a directed graph, determining which vertices are reachable from one another, either directly or indirectly.

adjacency-matrix cpp reachability transitive-closure warshall-algorithm

Activity

0 stars

0 watching

0 forks

Report repository

Navigation Menu

About

Releases

Packages

Contributors

Languages

Latest commit

History

Folders and files

About

Topics

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages