no code implementations • 14 Dec 2021 • Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar, Abhiruk Lahiri
Reconfiguring two shortest paths in a graph means modifying one shortest path to the other by changing one vertex at a time so that all the intermediate paths are also shortest paths.
