Let G be a graph. The distance between two nodes
u;v is the length of a shortest path between u and v and is denoted by d(u;v). The diameter of G is the maximum d(x;y),x;y is vertex of G. Use BFS algorithm to find the diameter of the input graph G.

Question

Let G be a graph. The distance between two nodes
u;v is the length of a shortest path between u and v and is denoted by  d(u;v). The diameter of G is the maximum d(x;y),x;y is vertex of  G. Use BFS algorithm to find the diameter of the input graph G.

e.mccormick · Answer

What programming language are you using and how far did you get?