We collected several undirected unweighted networks, which have been chosen in order to cover the largest possible set of network typologies, and we computed their diameter by using the iFUB algorithm. Note that, in the case of several of these graphs, the exact value of the diameter was still unknown or only approximated before we could compute it by using the iFUB algorithm. For all the real-world networks in our dataset (which are available in the NDE format), we report the filename, the number of the vertices and the number of the edges, both for the total graph and for the largest connected component, the diameter value, and the reference to the original source of the data file.