`LASAGNE` is a Java application which allows the user to compute distance measures on undirected unweighted graphs by making a clever use of the breadth-first search. In particular, the current version of `LASAGNE` can compute very efficiently the exact value of the diameter of a graph: the graph has to be connected. Moreover, `LASAGNE` can compute an approximation of the distance distribution of a graph. Finally, `LASAGNE` can compute the largest connected component of a graph.

- The
`LASAGNE`application - The source code

In a previous version of LASAGNE, the above features were integrated within a graphical user interface: this version is not maintained anymore.

For directed and/or weighted graph, check our software at the SumSweep section.