This ticket adds:

• a method that, given a connected (di)graph G = (V, E), returns an iterator over the connected subgraphs H = (V, F), where F is a subset of E.
• parameter induced to method connected_subgraphs_iterator. When set to True, the method iterates over induced connected subgraphs (current behavior). When set to False`, the method yields in addition the non-induced subgraphs.
• parameter edges_only to yield list of edges instead of graphs or list of vertices.

This ticket was opened based on #32047#comment:6

CC: @dcoudert

Component: graph theory

Keywords: connected graph, subgraph

Author: David Coudert

Branch/Commit: public/graphs/32136_subgraph_iterator @ e870546

Issue created by migration from https://trac.sagemath.org/ticket/32136