Graph Distance Matrix
The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(i j)) consisting of all graph distances from vertex v_i to vertex v_j. The distance matrix for graphs was introduced by Graham and Pollak. The mean of all distances in a (connected) graph is known as the graph's mean distance. The maximum value of all distance matrix elements is known as the graph diameter. The characteristic polynomial of the graph distance matrix is known as the distance polynomial.
all-pairs shortest path | antipodal graph | Bellman-Ford algorithm | detour matrix | Dijkstra's algorithm | distance polynomial | Floyd-Warshall algorithm | geodetic graph | graph diameter | graph distance | graph geodesic | Harary index | longest path | mean distance | shortest path | shortest path problem
