= Graph distance
{wiki=Graph_distance}
Graph distance refers to a measure of distance between nodes (or vertices) in a graph. In graph theory, nodes are the individual entities (like cities, web pages, etc.), and edges are the connections or relationships between these entities. There are a few different interpretations and methodologies for calculating graph distance, depending on the type of graph and the specific context: 1. **Shortest Path Distance**: The most common definition of graph distance is the shortest path distance between two nodes.
Back to article page
