Re: [boost] [Graph] Efficiently finding cycles in a (multi)graph

Louis Dionne writes:

Dear Boost,

I have implemented the `hawick_circuits` algorithm described in [1] for finding all the elementary circuits of a directed (multi)graph. I implemented it in a generic fashion, planning to propose it for inclusion in Boost.

[...] A Boost-ready implementation can be found here: https://github.com/ldionne/hawick_circuits Looking for comments/improvements/etc.. Louis Dionne