i dont know why i am getting wrong answer can any one please help me,thanks in advance link text asked 08 Mar '15, 14:48

use two bfs,start from 1 and by using bfs find the node with max distace ,making this node as starting point find the node with maz distace Algorithm: start:=bfs(G,1); res:=bfs(G,start); answered 22 Mar '15, 23:15
