This package has been made to compare some graph embedding algorithms. The following methods are implemented: Laplacian EigenMaps, Locally Linear Embedding, Higher-Order Proximity preserved Embedding (HOPE), Multi-dimensional scaling of a dissimilarity matrix, Node2vec, Struc2vec, Verse, Singular Value Decomposition of the Adjacency matrix, Kamada-Kawai Layout (KKL), Structural Deep Network Embedding (SDNE)
