Class LeadingVector<U>
java.lang.Object
es.uam.eps.ir.relison.sna.community.detection.modularity.LeadingVector<U>
- Type Parameters:
U
- Type of the users.
- All Implemented Interfaces:
CommunityDetectionAlgorithm<U>
public class LeadingVector<U> extends java.lang.Object implements CommunityDetectionAlgorithm<U>
Class for computing the community partition using the Leading Vector algorithm.
Problem: the JMod library does not actually work on Maven, so translating this into
our project is actually stopped.
Reference: M.E.J. Newman. Finding community structure in networks using the eigenvectors of matrices. Physical Review E 74 (2006)
-
Constructor Summary
Constructors Constructor Description LeadingVector()
-
Method Summary
Modifier and Type Method Description Communities<U>
detectCommunities(Graph<U> graph)
Computes the communities for a certain graph.
-
Constructor Details
-
LeadingVector
public LeadingVector()
-
-
Method Details
-
detectCommunities
Description copied from interface:CommunityDetectionAlgorithm
Computes the communities for a certain graph.- Specified by:
detectCommunities
in interfaceCommunityDetectionAlgorithm<U>
- Parameters:
graph
- The full graph.- Returns:
- The communities if everything went OK, null if not.
-