We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 3cb8f77 commit 2684000Copy full SHA for 2684000
matrix/transitive_closure.py
@@ -1,6 +1,7 @@
1
def transitive_closure(graph: list[list[int]]) -> list[list[int]]:
2
"""
3
- Computes the transitive closure of a directed graph using the Floyd-Warshall algorithm.
+ Computes the transitive closure of a directed graph using the
4
+ Floyd-Warshall algorithm.
5
6
Args:
7
graph (list[list[int]]): Adjacency matrix representation of the graph.
0 commit comments