Topic
Diameter of a Graph
Diameter of a graph is defined as the largest distance between any pair of vertices of G. Give an
efficient polynomial algorithm to find the diameter of the graph.
Algorithmic Programs
1. Do not require the user to take any part in the input (“Input the graph, or even input the number of
points or input size etc.)
Submission Instructions
1. Write-up explaining key implementation characteristics.
2. Numerical results for different input sizes. (Chart that indicates time complexity.)
3. Submit one (1) printed page (standard letter size), you can use both sides of paper front and
back, but no staples (1 page maximum, just like Project 1 2).
4. Submit your compliable code through email to the TA.
Submit all your .java file (or other executable codes, such as .cpp for C++ or .py for Python) Pay
attention to your readability, do not use random names for meaningful variables or methods. Also,
include reasonable comments.
Make sure your code has reasonable outputs, which should include the numerical results
and execution time for different inputs.
Write a README with brief descriptions of how should your program be executed.