The algorithm by M.Bauer and O.Golinelli to evaluate the moments of the spectral density of the incident matrix of random graphs is very useful also for other matrix ensembles: real symmetric, real anti-symmetric, real, laplacian, Wishart,... In most cases it may efficiently be performed by computer. The moments thus evaluated presumably will be useful to complement numerical simulations. In the large n limit, they are a transparent way to examine possible n-dependent rescaling then the emergence of universality and the validity of the addition theorem for random matrices.