Fix Qiskit#840: Add GraphML serializer

This commit adds a GraphML serializer:

```python
def write_graphml(
    graphs: list[PyGraph | PyDiGraph],
    keys: list[tuple[str, Domain, str, Type, Any]],
    path: str,
    /,
    compression: str | None = ...,
) -> None: ...
```

`keys` is a list of tuples: id, domain, name of the key, type, and
default value. This commit also introduces the
`read_graphml_with_keys` function, which returns the key definitions
in the same format, along with the list of parsed graphs.

The implementation preserves the ids of graphs, nodes, and edges when
possible. If some ids conflict, fresh ids are generated in the written
GraphML file. The `read_graphml` function has also been updated to
store the graph id in the graph attributes, just like node and edge
ids are stored in the corresponding attributes.

The `write_graphml` function supports gzip compression, as does
`read_graphml`.

Note that the JSON node-link serializer (the other part of Qiskit#840) was
already implemented in Qiskit#1091.

Compared to Qiskit#1462:

- Keys are passed explicitly instead of being inferred (which allows
to use the types `float` and `int`, and to use default values);

- Attributes for graphs, nodes, and edges are taken from the weight of elements, instead of relying on callbacks. This allows write_graphml to act as a proper reciprocal of read_graphml. Round-trip tests have been added.

- IDs are taken from attributes when possible, instead of being generated from indices.

- Multiple graphs can be written to the same file.

- Gzip compression is supported.

- Tests have been added.

Regarding @IvanIsCoding's
comment (Qiskit#1462 (comment)),
about using https://github.com/jonasbb/petgraph-graphml:

- Rustworkx's `graphml.rs` introduces an internal `Graph` data
structure, which is used for `read_graphml`. It is natural to
have `write_graphml` rely on the same data structure.

- `petgraph-graphml` generates ids from indices, which prevents us
from preserving ids accross the `read_graphml`/`write_graphml` round
trip.

Author: thierry-martinez

rustworkx/rustworkx.pyi

@@ -68,6 +68,20 @@ class ColoringStrategy:
     Saturation: Any
     IndependentSet: Any
 
+@final
+class Domain:
+    Node: Domain
+    Edge: Domain
+    Graph: Domain
+    All: Domain
+
+@final
+class Type:
+    Boolean: Type
+    Int: Type
+    Float: Type
+    Long: Type
+
 # Cartesian product
 
 def digraph_cartesian_product(
@@ -680,11 +694,23 @@ def directed_random_bipartite_graph(
 
 # Read Write
 
+def read_graphml_with_keys(
+    path: str,
+    /,
+    compression: str | None = ...,
+) -> tuple[list[tuple[str, Domain, str, Type, Any]], list[PyGraph | PyDiGraph]]: ...
 def read_graphml(
     path: str,
     /,
     compression: str | None = ...,
 ) -> list[PyGraph | PyDiGraph]: ...
+def write_graphml(
+    graphs: list[PyGraph | PyDiGraph],
+    keys: list[tuple[str, Domain, str, Type, Any]],
+    path: str,
+    /,
+    compression: str | None = ...,
+) -> None: ...
 def digraph_node_link_json(
     graph: PyDiGraph[_S, _T],
     /,