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