BFS up to nodes in distance=depth. It calculates the PMIs from a frequent itemsets hypergraph. TODO accept more than one merged node.
Return the list of possible nodes which center_node could merge
Returns a subgraph with a maximum number of edges taking the ones with more weight first and ensuring that the subgraph is connected