title: Find all possible path between two nodes in a undirected graph
body: <p>Can anybody give me a C Code to find all possible paths between two nodes?
  eg.
  if the graph has following edges
  1-2
  1-3
  2-3
  2-4
  3-4</p>
  
  <p>all paths between 1 and 4 are:</p>
  
  <p>1-2-3-4</p>
  
  <p>1-2-4</p>
  
  <p>1-3-4</p>
  
  <p>1-3-2-4</p>