5 more specifically given a node s and n 1 other nodes in the n star network our algorithm constructs n 1 node disjoint paths p1 p2 pn 1 where pi is a path from s to ti of length at most dist s ti 6 and dist s ti is the distance i e the length of a shortest path from s to ti for i 1 2 n 1 
