Before revision: Partitioning problems where the goal is to partition a graph into connected components are known to be NP-hard for some graph classes but polynomial-time solvable for others.
After revision: We study the problem of partitioning a weighted graph into connected components are known to be NP-hard for some graph classes but polynomial-time solvable for others.