We are presenting a system dedicated to the visualization and exploration of graphs. It is based on clustering
and visualization through a spring-embedder-type algorithm. A particularity of the program is the control given
to the user during actual simulations. We also introduce heuristics that help increase the processing speed of
the simulation to rapidly yield useful information relative to the topological organization of graphs and the
information they contain.