While taking over an existing software written in OCaml, cleaning the code was necessary before further development. To this end, a tool to find elements used or not would be useful to save time. We present an analysis of OCaml code based on the construction of an annotated dependency graph. The vertices of this graph are the elements of the OCaml language (values, modules, types, . . . ) and the annotations on the edges specify the kind of dependency (use, inheritance, . . . ). Thereafter, a language to select elements of this graph is defined to find non-referenced elements (revealing potentially useless code), or other elements such as record fields never consulted. This analysis is implemented and available in free software Oug. Some statistical analysis on the annotated graph are discussed in an attempt to ease the understanding of the organization of the analyzed code. MOTS-CLES : OCaml, dependances, fouille au code, statistiques, code inutile, code mort