Domanda di colloquio di Publicis Sapient

Shortest path in a weighted graph through two given vertices.