ImmutableValueGraph<Integer, String> graph =
        ValueGraphBuilder.directed()
            .<Integer, String>immutable()
            .putEdgeValue(2, 1, "2-1")
            .putEdgeValue(2, 3, "2-3")
            .putEdgeValue(1, 2, "1-2")
            .build();

    assertThat(graph.incidentEdges(2))
        .containsExactly(

    graph = ValueGraphBuilder.directed().incidentEdgeOrder(ElementOrder.stable()).build();
    graph.putEdgeValue(2, 1, "2-1");
    graph.putEdgeValue(2, 3, "2-3");
    graph.putEdgeValue(1, 2, "1-2");

    assertThat(graph.incidentEdges(2))
        .containsExactly(
            EndpointPair.ordered(2, 1), EndpointPair.ordered(2, 3), EndpointPair.ordered(1, 2))

    graph = ValueGraphBuilder.directed().incidentEdgeOrder(ElementOrder.stable()).build();
    graph.putEdgeValue(2, 1, "2-1");
    graph.putEdgeValue(2, 3, "2-3");
    graph.putEdgeValue(1, 2, "1-2");

    assertThat(graph.incidentEdges(2))
        .containsExactly(
            EndpointPair.ordered(2, 1), EndpointPair.ordered(2, 3), EndpointPair.ordered(1, 2))

* 🌐 Add Korean translation for Tutorial - First Steps. PR [#2323](https://github.com/tiangolo/fastapi/pull/2323) by [@hard-coders](https://github.com/hard-coders).

/ 8 encodingSize5 = n * 5 / 8 encodingSize4 = n * 4 / 8 encodingSize1 = n * 1 / 8 messageSize = encodingSize1 SharedKeySize = 32 SeedSize = 32 + 32 ) // ML-KEM-768 parameters. const ( k = 3 CiphertextSize768 = k*encodingSize10 + encodingSize4 EncapsulationKeySize = k*encodingSize12 + 32 decapsulationKeySize = k*encodingSize12 + EncapsulationKeySize + 32 + 32 ) // ML-KEM-1024 parameters. const ( k1024 = 4 CiphertextSize1024 = k1024*encodingSize11 + encodingSize5 EncapsulationKeySize = k1024*encodingSize12...