# Exploring the dimensions

How many pair of nodes $$(u,v)$$ in the following graph are there such that the shortest path between $$u$$ and $$v$$ is length $$2$$?

Details and Assumptions

×