# Warshall's Algorithm

Jump to navigation
Jump to search

This is a stub or unfinished. Contribute by editing me. |

**Warshall's Algorithm** is the general algorithm for calculating transitive closures of binary operations. It was later redeveloped as Floyd-Warshall's Algorithm to be more general, but this algorithm can be used to calculate graph connectivity.