The Scientific World Journal / 2013 / Article / Alg 3

Research Article

Many-to-Many Multicast Routing Schemes under a Fixed Topology

Algorithm 3

= MDCT .
Step_1: Use the Floyd’s algorithm to find all-pairs shortest paths
   and then obtain ;
Step_2:  for  {all   do
     ;
    end  for
   for all   do
    if     then
     Compute by (24);
    else  for all   do
       Compute by (24);
      end  for
    end  if
   end  for
Step_3: Trace out top-down from of ;