Algorithms: Graph Algorithms

def is_bipartite(graph: list[int], n: int) -> int:
    alg_require(isinstance(graph, (list, tuple)) and len(graph) <= 1000000)
    alg_require(type(n) is int and -2147483648 <= n <= 2147483647)
    alg_require(n >= 0 and n <= 1000000)
    alg_require(len(graph) == n * n)
    color: list[int] = [0] * alg_size(n + 1)
    queue: list[int] = [0] * alg_size(n + 1)
    source: int = 0
    head: int = 0
    tail: int = 0
    u: int = 0
    v: int = 0

int is_bipartite(const int *graph, size_t graph_length, int n) {
    int alg_error = 0;
    int alg_result = INT_MIN;
    errno = 0;
    int *color = NULL;
    int *queue = NULL;
    if (graph_length > 1000000 || (graph_length && !graph)) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (!(((n >= 0) && (n <= 1000000)))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    if (!(((int)graph_length == alg_mul(n, n, &alg_error)))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    {

int is_bipartite(const std::vector<int>& graph, int n) {
    alg_require(graph.size() <= 1000000);
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require(((int)graph.size() == alg_mul(n, n)));
    std::vector<int> color(alg_size(alg_add(n, 1)), 0);
    std::vector<int> queue(alg_size(alg_add(n, 1)), 0);
    int source = 0;
    int head = 0;
    int tail = 0;
    int u = 0;
    int v = 0;
    while ((source < n)) {

    static int is_bipartite(ReadOnlySpan<int> graph, int n) {
        checked {
            alg_require(((n >= 0) && (n <= 1000000)));
            alg_require((graph.Length == (n * n)));
            int[] color = new int[alg_size((n + 1))];
            int[] queue = new int[alg_size((n + 1))];
            int source = 0;
            int head = 0;
            int tail = 0;
            int u = 0;
            int v = 0;
            while ((source < n)) {

function is_bipartite(array $graph, int $n): int {
    alg_require(array_is_list($graph));
    alg_require((($n >= 0) && ($n <= 1000000)));
    alg_require((count($graph) == alg_mul($n, $n)));
    $color = array_fill(0, alg_size(alg_add($n, 1)), 0);
    $queue = array_fill(0, alg_size(alg_add($n, 1)), 0);
    $source = 0;
    $head = 0;
    $tail = 0;
    $u = 0;
    $v = 0;
    while (($source < $n)) {