Publicis Sapient interview question

Shortest path in a weighted graph through two given vertices.