Rewiring Strategy Based on Directed Betweenness to Mitigate Disruptions of Large-Scale Supply Chain Networks

Algorithm 1

Rewiring algorithm.

	Input:
	a graph ;
	a rewiring probability ;
	For each supplier node :
	begin
	For each shortest path from to custom node :
	begin
	;
	if
	begin
	= the node which has the largest directed betweenness on ;
	delete and its edges to its neighbor nodes from ;
	= search the shortest path from to ;
	add and its edges to its neighbor nodes into ;