Machine Learning Based Distribution of Sports Video Stream Assisting Physical Training

Algorithm 1

Cut vertices spanning tree algorithm

Input: ,

Output:

use finding cut vertex sets method to get cut vertex sets ;

for

 if the subnet connected to does not have terminal nodes

  delete from

end for;

use Prim algorithm for all to get a basic

while (all are not all in ) do

 for all

  find with the smallest bandwidth value used to connect to the current

  add the terminal node and path to

 end for;

end while;

for all terminal nodes

 if maximum bandwidth requirements are not met

  find other paths that can increase bandwidth reversely

   if find a path with higher bandwidth

    replace the original path

   end if;

 end if;

end for;

for all links

 if find links that can improve link utilization without reducing the bandwidth requirements of the end nodes

  replace the original path

 end if;

end for;

return;