This program creates a graph (currently in DOT format) that represents the dependencies between Ada packages.
The program has few nice options such as "ignore list" (to keep some packages out of the graph) and "trim lists," used to "collapse" a whole package subtree to its root node. Those two options are quite useful for very complex projects whose graph would be too complex to be useful.
Currently it works only for GNAT since it acquires the dependency data by reading the ALI files generated by the GNAT compiler. A future version will use the ASIS interface and it should work for every Ada compiler.