Reference no: EM132757529

Design an algorithm to find the center vertex of the graph, that has the minimum maximum distance to all the vertices. [A vertex is called the center vertex of graph, if we travel from this vertex to all the vertices, then maximum distance from this vertex to all the other vertices is minimum].After writing the algorithm, Derive

Your algorithm's time complexity.

-In this graph if A is the selected vertex -maximum distance to reach all is 4
-In this graph if Bis the selected vertex -maximum distance to reach all is 3
-In this graph if Cis the selected vertex -maximum distance to reach all is 2
-In this graph if Dis the selected vertex -maximum distance to reach all is 3
-In this graph if Eis the selected vertex -maximum distance to reach all is 3
-in this graph if Fis the selected vertex -maximum distance to reach all is 3
-In this graph if Gis the selected vertex -maximum distance to reach all is 4

We have to find this vertex C, having minimum maximum distance in graph. general solution needed to solve the problem (this is all the information i have ...i have nothing more to add. Please answer with this much information and do not put my question on hold again and again)