# TODO: Implement the function. The function is partially implemented below.

def get$\_$average$\_$path$\_$length$($g$,$ n$\_$samples$=100)$:

$"""$

Get the average path length between two random nodes.

$"""$

# Pick two random distinct node pairs

n$\_$nodes $=$ g$.$vcount$()$

while True:

src $=$ np$.$random.choice$($n$\_$nodes, n$\_$samples$)$

trg $=$ np$.$random.choice$($n$\_$nodes, n$\_$samples$)$

# If all the two nodes are distinct

# $($We do not want to have two nodes to be the same node, which results in the path length of $0,$ leading to the underestimation of the average path length$)$

if np$.$all$($src $!=$ trg$)$:

break

# Compute the average shortest path length between the sampled nodes

path$\_$lengths $=...$

# Return the average path length

return np$.$mean$($path$\_$lengths$)$