Example

There are center nodes $=6$ centers, and cernter edges $-6$ roads.

The network of roads is described by center$\_$from $=[1,2,3,4,5,6]$ and center$\_$to $,$

$5,6,17$

The statuses of centers are status $=[3,2,1,2,1,2]$

takes $2$ units of time for both deficient centers $3$ and $5$ to receive vaccines from the

rplus center $1.$ The minimum possible time is $2\mathrm{.}1.$ Vaccination DriveIn order to curb the spread of the novel COVID$-19$ virus, the citizens of Hackerland need to be vaccinated on priority.ALLDThere are center$\_$nodes vaccination centers in Hackerland, where each center has a status denoted by status$[$i$]$:$$ Centers with a shortage of vaccines have status $1.$ Those with sufficient vaccines have status $2.$ Those with a surplus have status $3.$Vaccines can be transferred from centers with a surplus to centers with a deficit. There is a network of bidirectional roads between centers where the ith road is between cities center$\_$from$[$i$]$ and center$\_$to$[$i$].$ Each road takes $1$ unit of time to traverse. Find the minimum time in which all deficient centers can receive a supply of vaccines from some surplus center.