Ask your own question, for FREE!
Computer Science 8 Online
OpenStudy (anonymous):

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.

OpenStudy (e.mccormick):

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

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!