use decomposition into bi/tri-connected components and atoms for iterating over minimal separators

[dcoudert]

In #39341, we added an iterator over the minimal separators of a graph. Here we use decompositions into bi and tri connected components:

• We first decompose the graph into biconnected components. Cut vertices are minimal separators. We then search for the minimal separators of each biconnected component
• We then decompose each biconnected component into triconnected components. The "P" blocks of the SPQR-tree are minimal separators of order 2. The "S" blocks are cycle and each edge of its complement is a minimal separator. It remains to search for minimal separators in each "R" block (a triconnected component) using the main loop of the algorithm.

📝 Checklist

• The title is concise and informative.
• The description explains in detail what this PR is about.
• I have linked a relevant issue or discussion.
• I have created tests covering the changes.
• I have updated the documentation and checked the documentation preview.

⌛ Dependencies

[github-actions]

Documentation preview for this PR (built with commit ed70480; changes) is ready! 🎉
This preview will update shortly after each push to this PR.

[dcoudert]

We can also use a decomposition of the graph by clique minimal separators. It then remains to consider the atoms of the graph.