Given the digraph as shown below calculate the distance between Vertex 2 and Vertex 3httpscorexjtlueducnpluginfilephp535211questionquestiontext2444812141221438Q_DistDigraphpng

The distance between Vertex 2 and Vertex 3 is 4.

One possible path from Vertex 2 to Vertex 3 is: 2 -> 5 -> 4 -> 3.

The sum of the weights along this path is: 1 + 2 + 1 = 4.

There may be other paths with the same distance, but this is one example.