title: Shortest path between two nodes in a graph (Java)
body: <p>I have a program with a graph whose nodes represent some processes, and the proccess computing time is the node's cost.This graph is maintainded in memory as a list of nodes and each nod has a list of parent and children, and his execution time.</p>
  
  <p>I must find the path with the minimum execution time.</p>
  
  <ul>
  <li>Each node can connect with any other.</li>
  <li>There is only one start node and one end node.</li>
  <li>One node can have various "parent" and "children"</li>
  </ul>
  
  <p>Can someone tell me the best way to do this?</p>