title: Which algorithm is best to traverse weighted , directed graph provided the start and end point?
body: <p>Hi I am looking for the best algorithm to find out the optimal path traversing a directed and weighted graph.</p>
  
  <p>[Hi all, I am editing the problem for explaining my requirement completely]</p>
  
  <p>e.g: If in a graph of 5 nodes (let's assign number 1,2,3,4,5 to all the 5 nodes respectively), if I wish to start traversing from node 2 and end up at 4 , covering all the nodes, then which is the best algorithm to solve the problem ? </p>
  
  <p>We can have two assumptions :</p>
  
  <p>a) There is always an edge between any two nodes. (means for two nodes (A and B) there is an edge from A to B and from B to A as well.</p>
  
  <p>b) we can traverse a node twice (If necessary to traverse complete graph).</p>