/// <summary>
/// T in the KL algorithm
/// </summary>
/// <param name="pNA"></param>
/// <param name="pNB"></param>
/// <returns></returns>
internal int ComputeInitialInterPartitionCost(IPartition p1, IPartition p2)
{
return(p1.GetEdgesBetween(p2).Count() + p2.GetEdgesBetween(p1).Count());
}
