Algorithms: Graph Algorithms Tutorials and Code Examples - Page 12

Bellman Ford Shortest Path in Java

Bellman-Ford permits negative edge weights and detects negative cycles reachable from the source.

java

    static int bellman_ford(int[] from_vertex, int[] to_vertex, int[] weight, int n, int source, int target) {
        java.util.Objects.requireNonNull(from_vertex, "from_vertex");
        java.util.Objects.requireNonNull(to_vertex, "to_vertex");
        java.util.Objects.requireNonNull(weight, "weight");
        int m = from_vertex.length;
        alg_require(((n >= 0) && (n <= 1000000)));
        alg_require(((m >= 0) && (m <= 1000000)));
        alg_require((from_vertex.length == m));
        alg_require((to_vertex.length == m));
        alg_require((weight.length == m));
        alg_require(((n >= 1) && (source >= 0) && (source < n)));
        alg_require(((target >= 0) && (target < n)));

Nov 15, 2026 Java

Algorithms: Graph Algorithms

Disjoint Set Union in PHP

Disjoint set union maintains connected components as a forest of parent links.

php

function component_count(array $u_edges, array $v_edges, int $n): int {
    alg_require(array_is_list($u_edges));
    alg_require(array_is_list($v_edges));
    $m = count($u_edges);
    alg_require((($n >= 0) && ($n <= 1000000)));
    alg_require((($m >= 0) && ($m <= 1000000)));
    alg_require((count($u_edges) == $m));
    alg_require((count($v_edges) == $m));
    for ($alg_i = 0; $alg_i < count($u_edges); $alg_i++) {
        $alg_value = $u_edges[$alg_i];
        alg_require((($alg_value >= 0) && ($alg_value < $n)));
    }

Nov 15, 2026 PHP

Algorithms: Graph Algorithms

Disjoint Set Union in C#

Disjoint set union maintains connected components as a forest of parent links.

csharp

    static int component_count(ReadOnlySpan<int> u_edges, ReadOnlySpan<int> v_edges, int n) {
        checked {
            int m = u_edges.Length;
            alg_require(((n >= 0) && (n <= 1000000)));
            alg_require(((m >= 0) && (m <= 1000000)));
            alg_require((u_edges.Length == m));
            alg_require((v_edges.Length == m));
            for (int alg_i = 0; alg_i < u_edges.Length; alg_i++) {
                int alg_value = u_edges[alg_i];
                alg_require(((alg_value >= 0) && (alg_value < n)));
            }
            for (int alg_i = 0; alg_i < v_edges.Length; alg_i++) {

Nov 15, 2026 csharp

Algorithms: Graph Algorithms

Disjoint Set Union in C++

Disjoint set union maintains connected components as a forest of parent links.

cpp

int component_count(const std::vector<int>& u_edges, const std::vector<int>& v_edges, int n) {
    alg_require(u_edges.size() <= 1000000);
    alg_require(v_edges.size() <= 1000000);
    int m = (int)u_edges.size();
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require(((m >= 0) && (m <= 1000000)));
    alg_require(((int)u_edges.size() == m));
    alg_require(((int)v_edges.size() == m));
    for (int alg_i = 0; alg_i < (int)u_edges.size(); alg_i++) {
        int alg_value = u_edges[alg_i];
        alg_require(((alg_value >= 0) && (alg_value < n)));
    }

Nov 15, 2026 C++

Algorithms: Graph Algorithms

Disjoint Set Union in C

Disjoint set union maintains connected components as a forest of parent links.

c

int component_count(const int *u_edges, size_t u_edges_length, const int *v_edges, size_t v_edges_length, int n) {
    int alg_error = 0;
    int alg_result = INT_MIN;
    errno = 0;
    int *parent = NULL;
    int *size = NULL;
    if (u_edges_length > 1000000 || (u_edges_length && !u_edges)) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (v_edges_length > 1000000 || (v_edges_length && !v_edges)) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    int m = (int)u_edges_length;
    if (alg_error) { errno = ERANGE; 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; }

Nov 15, 2026 C