Shortest Path Distance Approximation Using Deep Learning: Node2Vec | by Asutosh Nayak | Towards Data Science

This article is an implementation of a research paper titled “Shortest Path Distance Approximation using Deep Learning Techniques”, where the authors explain a new method to approximate the shortest path distance between the nodes of a graph. I will explain the paper and my implementation of it. You can find the project on my GitHub account here. First I will give an overview of the method proposed in this paper, then we will go through some of the concepts used in this paper to solve the problem and finally the implementation.
— Read on

Leave a Reply