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**

The length of a path is the number of edges it has.

The graph is given in an adjacency matrix representation.

×

Problem Loading...

Note Loading...

Set Loading...