Control flow graph: setup (#17064)

This PR contains the scaffolding for a new control flow graph
implementation, along with its application to the `unreachable` rule. At
the moment, the implementation is a maximal over-approximation: no
control flow is modeled and all statements are counted as reachable.
With each additional statement type we support, this approximation will
improve.

So this PR just contains:
- A `ControlFlowGraph` struct and builder
- Support for printing the flow graph as a Mermaid graph
- Snapshot tests for the actual graphs
- (a very bad!) reimplementation of `unreachable` using the new structs
- Snapshot tests for `unreachable`

# Instructions for Viewing Mermaid snapshots
Unfortunately I don't know how to convince GitHub to render the Mermaid
graphs in the snapshots. However, you can view these locally in VSCode
if you install an extension that supports Mermaid graphs in Markdown,
and then add this to your `settings.json`:

```json
  "files.associations": {
"*.md.snap": "markdown",
  }
  ```

crates/ruff_python_semantic/resources/test/fixtures/cfg/no_flow.py

@@ -0,0 +1,24 @@
+def func(): ...
+
+
+def func():
+    pass
+
+
+def func():
+    x = 1
+    x = 2
+
+
+def func():
+    foo()
+
+
+def func():
+    from foo import bar
+
+    class C:
+        a = 1
+
+    c = C()
+    del c