[igraph] Community Detection using leading eigenvector
From:
Denzil Correa
Subject:
[igraph] Community Detection using leading eigenvector
Date:
Sat, 17 Dec 2011 16:51:30 +0530
Hi,
I would like Prof. Newman's "Leading Eigenvector for Community Detection" algorithm on a weighted directed graph. I currently see an implementation for just the undirected (and unweighted) version. Am I missing something OR has this been left out?