title: All possible paths from one node to another in a directed tree (igraph)
body: <p>I use <a href="http://igraph.sourceforge.net/doc/python/index.html" rel="noreferrer">python binding</a> to <a href="http://igraph.sourceforge.net" rel="noreferrer">igraph</a> to represent a directed tree. I would like to find all possible paths from one node in that graph to another one. Unfortunately, I couldn't find a ready to use function in igraph that performs this task? </p>
  
  <p><strong>EDIT</strong> </p>
  
  <p><em>The concerns on infinite number of paths</em></p>
  
  <p>the graph I'm talking about is actually a directed acyclic graph (DAG) with a single root. It represents a unidirectional cascade of events that, on various levels of the cascade, can either split or join together. As I said, this is a unidirectional graph. It is also provided that the graph does not contain any cycles. Due to these two reasons, infinite list of paths, is impossible.</p>
  
  <p><em>What am I trying to do?</em></p>
  
  <p>My goal is to find all the possible paths that lead from the top of the graph (the root) to the given node.</p>