We introduce an abstract framework for the study of clustering in metric graphs: after suitably metrising the space of graph partitions, we restrict Laplacians to the clusters thus arising and use their spectral gaps to define several notions of partition energies; this is the graph counterpart of the well-known theory of spectral minimal partitions on planar domains and includes the setting in Band et al. (Commun Math Phys 311:815-838, 2012) as a special case. We focus on the existence of optimisers for a large class of functionals defined on such partitions, but also study their qualitative properties, including stability, regularity, and parameter dependence. We also discuss in detail their interplay with the theory of nodal partitions. Unlike in the case of domains, the one-dimensional setting of metric graphs allows for explicit computation and analytic-rather than numerical-results. Not only do we recover the main assertions in the theory of spectral minimal partitions on domains, as studied in Conti et al. (Calc Var 22:45-72, 2005), Helffer et al. (Ann Inst Henri Poincare Anal Non Lineaire 26:101-138, 2009), but we can also generalise some of them and answer (the graph counterparts of) a few open questions
