You are given the following flow$-$between matrix for $6$ departments of a facility.

A couple of steps of the graph based method is already applied for the facility and the adjacency graph of

the first $4$ selected departments is found as follows:

Complete the rest of the iterations $($operations$)$ of the graph$-$based method and find the final

adjacency graph $($that contains all six departments$).$