Hi There.<br>I&#39;m a boost newbie, so my apologies if this has been discussed before:<br>I need to <br>1) Enumerate all paths of a certain length in a given graph.<br>2) Find all Euler paths in a given eulerian graph.<br>
<br>Any idea on how to do that with boost?<br><br>Thanks<br>Yaron<br><br>