Distance (graph theory)
id:
distance-graph-theory-265-2378990
title:
Distance (graph theory)
text:
In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path connecting them. This is also known as the geodesic distance or shortest-path distance. Notice that there may be more than one shortest path between two vertices. If there is no path connecting the two vertices, i.e., if they belong to different connected components, then conventionally the distance is defined as infinite. In the case of a directed graph the distance
brand slug:
wiki
category slug:
encyclopedia
description:
Length of shortest path between two nodes of a graph
original url:
https://en.wikipedia.org/wiki/Distance_(graph_theory)
date created:
date modified:
2024-01-06T23:37:36Z
main entity:
{"identifier":"Q2742711","url":"https://www.wikidata.org/entity/Q2742711"}
image:
fields total:
13
integrity:
14