The networks extension also includes commands that let you find paths between nodes in a graph. Starting with a random person in your network, find the person who is the furthest from them (it takes the most hops to get to). How many nodes need to be visited to get to them? Can you figure out what the largest shortest path is in your network?