Algorithmresearch
Italiano's dynamic transitive closure algorithm
Also called Italiano algorithm.
Maintains reachability of a directed graph under edge insertions and deletions.
Maintains reachability of a directed graph under edge insertions and deletions.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 08JB9Z Edit this page History Report an error