What are the differences between community detection algorithms in igraph?

Question

I have a list of about 100 igraph objects with a typical object having about 700 vertices and 3500 edges.

I would like to identify groups of vertices within which ti

Answer 1

A summary of the different community detection algorithms can be found here: http://www.r-bloggers.com/summary-of-community-detection-algorithms-in-igraph-0-6/

Notably, the InfoMAP algorithm is a recent newcomer that could be useful (it supports directed graphs too).