title: Which type of search would be suitable? (Graph Traversal)
body: <p>So, you have the following graph that has an Entrance, exit and an arbitrary number of nodes.</p>
  
  <p><img src="https://i.stack.imgur.com/AvBgo.png" alt="enter image description here"></p>
  
  <p>Your task is to get from the entrance to the exit with a resource level of more than 0. When you enter the "maze" you have a resource level of 0, when you land on one of the nodes you must modify your resource level by the amount show in brackets. You must reach the exit node with a resource level of more than 
  0.</p>
  
  <p>As you can see the resource count can be either increased or decreased.</p>
  
  <p>What algorithms would be suitable for finding the quickest route through the graph with the prior requirements?</p>
  
  <p>Programming Language - Java</p>