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
2
G
. Use BFS algorithm to nd 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
2
G
. Use BFS algorithm to nd the diameter of the input graph
G

arabpride · Answer

Might you try and ask in math section? while you're at it... a screenshot would be preferable in this case, because you've clearly copied and pasted, but some of the items you highlighted were not copied as they are. *^.^*