Publicis Sapient Interview Question

Shortest path in a weighted graph through two given vertices.