Problemcore
Transitive reduction
Finds the smallest subgraph of a directed graph that has the same reachability, removing edges implied by other paths.
Finds the smallest subgraph of a directed graph that has the same reachability, removing edges implied by other paths.
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 ESGDFK Edit this page History Report an error