The problem of routing and wavelength assignment is apparent in the dynamic all-optical network that plays an important role in the optical transport layer network. It is solved by minimising the connection blocking since the grooming adaptive shortest path algorithm shows comparably better results in terms of the calculation to find blocking probability. The shortest path algorithm used in this paper contains the present network state information, and each node creates a shortest path tree towards all the other nodes, which form node pairs by connecting each branch in the tree. The adaptive shortest path algorithm will find the shortest path throughout the network path and it chooses the best path from the available source-destination. Considering the number of nodes as 14 and comparing for different topology, it has been observed that the wavelength usage in each node varies with respect to different topology. Additionally, a comparative study of wavelength usage has been achieved for topologies like random, ring and tree.