| 1 | = Distance Measures = |
| 2 | |
| 3 | Distance Measures are all turning out to be kind of interesting - mainly because they're all secondary measures of the distance_map parameter for `shortest_paths` algorithms. So far, I'm providing the following vertex measures: |
| 4 | |
| 5 | `geodesic_distance(g, u, v, dist)` |
| 6 | This returns the distance of the shortest path between the vertices `u` and `v`. |
| 7 | |
| 8 | `mean_geodesic_distance(g, v, dist)` |
| 9 | Returns the (arithmatic) mean of shortest paths between `v` and all other vertices in `g`. |
| 10 | |
| 11 | `closeness` |
| 12 | |
| 13 | `eccentricity` |
| 14 | |
| 15 | We can also define the following graph measures: |
| 16 | |
| 17 | `radius` |
| 18 | |
| 19 | `diameter` |