f min$-$dist$\_$conn $(G,$I,$s)$

$//$weight nodes in $G$ with distance from $S$

Labeling $=BFS(G,s)$

$i=2$

$j=2+$diameter$(G),h=|\frac{i+j}{(2)}|$

while $(ji)$

flag fersible$-$coverage $($I$,h)//$feasibility for nodes at distance h

If flag is covered,

$j=h,$

else

$i=h$

$h=(\frac{i+j}{2}),$ write python code for this using networkx library and plot the graph