int[] IN,OUT;
foreach (Node i in Vertices)
{
  List L=Node i's neighbor list;
  foreach (Node j in L)
  {
    IN[j]++;
    OUT[i]++;
  }
}
return IN & OUT;

2Â¥: Originally posted by sidswq at 2012-10-19 13:31:04
×Ô¼º¿´Í¼ÂÛµÄÊé°¡