title: Dijkstra shortest path algorithm with edge cost
body: <p>I have a directed, positive weighted graph. Each edge have a cost of use.
  I have only A money, i want to calculate shortest paths with dijkstra algorithm, but sum of edges costs on route must be less or equal to A.</p>
  
  <p>I want to do this with most smallest Dijstra modification (if I can do it with small modification of Dijkstra). I must do this in <code>O(n*log(n))</code> if I can, but i think i can.</p>
  
  <p>Anyone can help me with this?</p>