OJ Board

Cosmin - Does your solution work on weighted trees?
Cho - I didn't really understand why the algo you suggested works.

Thanks

Hi,

I was hoping somebody could explain me an algorithm to find the 'central node' of a tree, i.e. - the node from which the maximum distance to any other vertex is minimized over all vertices.

Thank You

I just needed some help on 10129.

if I understand corerctly I have to make a graph of all the 26 letters and then add a directed edge between the first letter and last letter of each word and then check for an eulerian path? is this correct.

also, i know how to check an eulerian path in an ...