Brad is provided with a graph containing X branches. And it's given that the xth branch has a weight of Px. And for the given condition y-I + Py-Px there exits an edge connecting the branches. You...

dtgdf

Extracted text: Brad is provided with a graph containing X branches. And it's given that the xth branch has a weight of Px. And for the given condition y-I + Py-Px there exits an edge connecting the branches. You have to develop a Python code that finds the number of connected components in this graph. Example Input: 1 3 152 Result: 1