When using hexagonally connected data-driven array as a target computer architecture, and a certain well known algorithm to perform the mapping of program graphs on it, it is known that the results of such mapping generally can be improved. In this paper a software tool is described, named graph compactor, which has been designed to perform area-time optimization of program graph mappings.