1. A method for ranking nodes in a graph, wherein the method comprises: computing resultant path strength between each pair of nodes in a polynomial time; determining a first node based on resultant path strength such that total path strength to the first node is a maximum value, wherein the resultant path strength is the sum total of strengths of all possible paths in the graph between two nodes, and wherein the first node is the node that is connected to a maximum number of nodes in the graph, Said determining comprising: Determining a sequence (S) of nodes (i), S={i 1 , i 2 , i 3 ,. .. , i n } such that ∑ p ⁢ ⁢ W ^ i p ⁢ i p + 1 is a maximum value, wherein Ŵ is a matrix representing connectivity between nodes in a the graph, and p represents node position in the graph; iteratively determining a next node from the first node to which the resultant path strength is a maximum value and the node is not visited; and providing each determined node a unique rank value, and ranking the nodes in an order determined by the unique rank value of each node.