title: Finding Shortest path in weighted directional multigraph with extra constraints
body: <p>Given a weighted directed multigraph, I have to find shortest path between starting vertex u to vertex v. Apart from weight, each edge also has time. The path connecting u and v cannot take more than a given maximum time. The trouble is while using Djikstra, there are chances that shortest path takes more time than the limit.</p>
  
  <p>My approach is to find all valid paths between u and v and than minimize the weight. But the approach is not practical due to its high complexity.</p>
  
  <p>Any ideas?</p>