Problemcore
Shortest paths of fixed length
Problem of finding shortest walks using exactly k edges between vertices, solved by min-plus matrix exponentiation of the weight matrix.
Problem of finding shortest walks using exactly k edges between vertices, solved by min-plus matrix exponentiation of the weight matrix.
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 VGF0WD Edit this page History Report an error