I am implementing algorithms concerning the distributed algorithms module and after the spanning tree protocol our teacher has asked us to implement an improved version Strategy Broadcast-Tree Construction consisting on : i. determine a center c of G; ii. construct a breadth-first spanning tree BFT(c,G) rooted in c.
but i have problem with the first point to determine the center of network so i can't keep going on and i need help so if anyone tried and get a solution give me a push
construct a spanning tree, since finding center existing algorithms work on a tree.
use a modified saturation technique to find centers paper
start a BFT from a center.