A new algorithm to enhance the pinning controllability of complex networks of chaotic maps is presented. Leveraging the numerical observation that the existence of directed cycles in the graph hinders controllability, we develop an iterative procedure to obtain a forest structure in the graph. The effectiveness of the algorithm is illustrated with reference to the test-bed example of a network of coupled logistic maps.