Machine Learning, Graph, TensorFlow, Algorithms, Data Science.
paths are A*, Dijkstra’s and Bellman Ford. These are robust and widely implemented. Dijkstra’s is most similar to our use case, of finding the shortest path between two specific nodes with no available path cost heuristic. The earliest work on neural based solutions to shortest path was motived by