Need help with network science please

Question

Consider the following undirected graph (draw a picture) with vertex set V={1,2,3,4,5} and edge set E={(1,2),(1,5),(2,3),(3,4),(4,5)}. What is the average path length i.e. the average shortest path length for all pairs of vertices?

Answer 1

Great question Frank. The important concepts needed to solve this question are List Comprehensions and your research ability to locate a third-party library which applies to your question. In this case I use the Python library NetworkX to solve finding the average shortest path length for an entire graph.