In the context of network theory and graph theory, the **average path length** is a metric that measures the average number of steps (or edges) along the shortest paths for all possible pairs of nodes (vertices) in a graph. It provides an indication of how "far apart" nodes are on average, which can help characterize the structure and efficiency of the network.
New to topics? Read the docs here!