private CommunityStructure _NewAlgorithm(GraphD.DGraph pGraph)
{
graph = pGraph.Clone();
int NodeCount = graph.Nodes.Count();
CommunityStructure tempCS = FindStructureWithMaxClique(graph);
while (VisitedNodeCount < NodeCount)
{
while (true)
{
VisitNode(graph);
if (CheckNewCommunity(graph))
{
break;
}
}
// Tính Q
Q = CalculateModularity(tempCS, pGraph);
if (Q > _BestQ)
{
_BestQ = Q;
Cs = tempCS;
}
}
return(Cs);
}
public CommunityStructure FindCommunityStructure(GraphD.DGraph pGraph)
{
return(_NewAlgorithm(pGraph));
}
