private void CalculateCoefficientInformation()
{
if (pathInformation == null)
{
CalculatePathInformation();
}
Debug.Assert(coefficientInformation == null);
coefficientInformation = new ClusteringCoefficientInformation();
int e = 0, n = 0;
double current = 0;
for (int i = 0; i < container.Size; ++i)
{
n = container.GetVertexDegree(i);
if (n != 0)
{
e = (n == 1) ? 1 : n * (n - 1) / 2;
current = (commonInformation.Edges[i]) / e;
coefficientInformation.Coefficients.Add(i, Math.Round(current, 3));
}
else
{
coefficientInformation.Coefficients.Add(i, 0);
}
}
}
public QuickGraphAnalyzer(AbstractNetwork n) : base(n)
{
commonInformation = null;
pathInformation = null;
coefficientInformation = null;
}