title: Maximum weighted path between two vertices in a directed acyclic Graph
body: <p>Love some guidance on this problem:</p>
  
  <p>G is a directed acyclic graph. You want to move from vertex c to vertex z. Some edges reduce your profit and some increase your profit. How do you get from c to z while maximizing your profit. What is the time complexity?</p>
  
  <p>Thanks!</p>