graph distance (Q2670)
Jump to navigation
Jump to search
in graph theory, the minimum number of edges in a path connecting two vertices
- geodetic distance
- distance
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | graph distance |
in graph theory, the minimum number of edges in a path connecting two vertices |
|