Topology-Aware Bus Routing in Complex Networks of Very-Large-Scale Integration with Nonuniform Track Configurations and Obstacles

Algorithm 1

Unsplittable flow problem solving.

	Input: The graph , all bits of a bus.
	Output: The set of paths that connecting the bits.
(1)	Partition the set of bits into two disjoint sets and ;
(2)	for i = 1, 2 do
(3)	;
(4)	for each from to do
(5)	;
(6)	Sort the bits in according to a nonincreasing order of ;
(7)	for each do
(8)	if path of bit s.t. and then
(9)	Route the bit on and for set ;
(10)	Update ;
(11)	end if
(12)	end for
(13)	end for
(14)	end for