DFS from X ( other end of diameter ) and check the farthest node ( s ) from it
dfs ( X , - 1 , 0 , true , adj ) ; } function printDiameters ( adj ) { dfsUtility ( adj ) ; for ( let i = 1 ; i <= 6 ; i ++ ) {