Problemcore
Graph edit distance
Also called GED.
Minimum total cost of vertex and edge insertions, deletions and substitutions that turn one graph into another.
Minimum total cost of vertex and edge insertions, deletions and substitutions that turn one graph into another.
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 7C5GE2 Edit this page History Report an error