SpecDist page   SpecDist is a collection of C++ programs developed for computing spectral distances between simple finite graphs. The spectral distance between two graphs of the same order is defined as the sum of the absolute differences between corresponding eigenvalues, listed in non-increasing order. These eigenvalues may correspond to the adjacency matrix, the Laplacian matrix, or the signless Laplacian matrix of a graph. The software also includes procedures for computing Laplacian and signless Laplacian energies. The code was written by Irena Jovanović and Zoran Stanić.     All executable files (for Windows), example input files, and the readme.pdf file (containing all necessary details) for the latest version 2.0 (2017) are included here. The initial version, released in 2012, contained only the file SpecDist.exe.    Initial results obtained by using SpecDist are summarized in I. Jovanović, Z. Stanić, Spectral distances of graphs, Linear Algebra Appl., 436 (2012) 1425-1435 and I. Jovanović, Z. Stanić, Spectral distances of graphs based on their different matrix representations, Filomat, 28 (2014) 723-734.    If you use SpecDist in your research, please cite the first of the above papers (where the software is described).