[igraph] community detection for directed graph

[sloiseau]

Hello all,

I use the walktrap algorithm for clustering a set of graphs ; one of this
graph is oriented. I'm wondering if:
- is there a solution for the walktrap algorithm to follow directed graphs ;
- if not, does someone know which community dectection algorithm is the
"closest" to the walktrap one, in order to have the clustering of the
different graphs as comparable as possible?

Best,
Sylvain