1 paper · 1 filter
Abderrahim Bendahi, Adrien Fradin
Finding a shortest path in a graph is one of the most classic problems in algorithmic and graph theory. While we dispose of quite efficient algorithms for this ordinary problem (li…