Graph TheoryEasyWalks, Paths and Connectivity
Walks, Paths and Connectivity · Easy problem
In the graph with center vertex joined to , and , and vertex also joined to (edges ), what is the length of the shortest path from vertex to vertex ?
In the graph with center vertex joined to , and , and vertex also joined to (edges ), what is the length of the shortest path from vertex to vertex ?