{"id":11316,"date":"2025-12-16T12:23:37","date_gmt":"2025-12-16T06:53:37","guid":{"rendered":"https:\/\/namastedev.com\/blog\/?p=11316"},"modified":"2026-01-11T19:59:09","modified_gmt":"2026-01-11T14:29:09","slug":"bellman-ford-algorithm-code","status":"publish","type":"post","link":"https:\/\/namastedev.com\/blog\/bellman-ford-algorithm-code\/","title":{"rendered":"Bellman Ford Algorithm Code"},"content":{"rendered":"\n<!-- Shortest Path in unweighted graph -->\n<!-- PrismJS for Syntax Highlighting -->\n<link href=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/themes\/prism-tomorrow.min.css\" rel=\"stylesheet\">\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/prism.min.js\"><\/script>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/plugins\/autoloader\/prism-autoloader.min.js\"><\/script>\n\n<style>\n.wp_blog_theme {\n  --primary: #E58C32;\n  --secondary: #030302;\n  --light-bg: #fef9f4;\n  --text-dark: #2d2d2d;\n  --tab-radius: 12px;\n  --shadow: 0 4px 12px rgba(0, 0, 0, 0.08);\n  --code-bg: #001f3f;\n  --code-text: #d4f1ff;\n}\n\n.wp_blog_container {\n  font-family: 'Segoe UI', sans-serif;\n  background: var(--light-bg);\n  margin: 0;\n  padding: 0;\n  color: var(--text-dark);\n}\n\n\/* Heading *\/\n.wp_blog_main-heading {\n  text-align: center;\n  font-size: 2.4rem;\n  color: var(--primary);\n  margin-top: 2.5rem;\n  font-weight: bold;\n}\n\n\/* Explanation Card *\/\n.wp_blog_explanation,\n.wp_blog_code-tabs-container {\n  max-width: 940px;\n  margin: 2rem auto;\n  padding: 2rem;\n  background: white;\n  border-radius: var(--tab-radius);\n  box-shadow: var(--shadow);\n}\n\n\/* Text and Visuals *\/\n.wp_blog_explanation h2 {\n  font-size: 1.4rem;\n  color: var(--primary);\n  margin-bottom: 0.5rem;\n}\n\n.wp_blog_explanation p,\n.wp_blog_explanation li {\n  font-size: 1.05rem;\n  line-height: 1.7;\n  margin: 0.5rem 0;\n}\n\n.wp_blog_explanation code {\n  background: #fef9f4;   \/* light bg instead of dark blue *\/\n  color: #E58C32;        \/* brand orange *\/\n  padding: 3px 6px;\n  border-radius: 4px;\n  font-family: 'Courier New', monospace;\n  font-weight: 600;      \/* optional, makes it pop *\/\n}\n\n.wp_blog_explanation img {\n  max-width: 100%;\n  border-radius: var(--tab-radius);\n  margin-top: 1rem;\n  box-shadow: 0 2px 12px rgba(0, 0, 0, 0.06);\n}\n\n\/* Tab Buttons *\/\n.wp_blog_code-tabs-header {\n  display: flex;\n  flex-wrap: wrap;\n  gap: 0.5rem;\n  margin-bottom: 1rem;\n}\n\n.wp_blog_code-tab-button {\n  padding: 0.6rem 1.2rem;\n  border: 1px solid var(--primary);\n  background: white;\n  color: var(--primary);\n  border-radius: 50px;\n  font-weight: 600;\n  cursor: pointer;\n  transition: all 0.3s ease;\n}\n\n.wp_blog_code-tab-button:hover {\n  background: var(--secondary);\n}\n\n.wp_blog_code-tab-button.active {\n  background: var(--primary);\n  color: white;\n}\n\n\/* Code Content *\/\n.wp_blog_code-tab-content {\n  display: none;\n  background: var(--code-bg);\n  border-radius: var(--tab-radius);\n}\n\n.wp_blog_code-tab-content.active {\n  display: block;\n}\n\n.wp_blog_code-tab-content pre {\n  margin: 0;\n  padding: 1.5rem;\n  font-size: 1rem;\n  overflow-x: auto;\n  background: var(--code-bg);\n  border-radius: var(--tab-radius);\n  color: var(--code-text);\n}\n\n\/* Dark mode variables *\/\n.wp_blog_theme.dark-mode {\n  --light-bg: #121212;\n  --text-dark: #f5f5f5;\n  --shadow: 0 4px 12px rgba(255, 255, 255, 0.08);\n  --code-bg: #1e1e1e;\n  --code-text: #c5f0ff;\n}\n\n.wp_blog_theme.dark-mode .wp_blog_explanation {\n  background: #1e1e1e;\n}\n\n\/* Dark mode code highlight *\/\n.wp_blog_theme.dark-mode .wp_blog_explanation code {\n  background: #333;\n  color: #ffd27f;\n}\n\n.wp_blog_theme {\n  position: relative; \/* makes it the reference for absolute children *\/\n}\n\n.wp_blog_toggle-btn {\n  position: absolute;\n  top: 1rem;\n  right: 1rem;\n  z-index: 9999;\n  padding: 0.5rem 0.8rem;\n  border-radius: 10%;\n  background: var(--primary);\n  color: white;\n  font-weight: bold;\n  cursor: pointer;\n  border: none;\n  box-shadow: var(--shadow);\n  transition: background 0.3s, transform 0.2s;\n}\n\n.wp_blog_toggle-btn:hover {\n  background: #cc772e;\n}\n\n.wp_blog_theme.dark-mode .wp_blog_code-tabs-container {\n  background: #1e1e1e;\n}\n<\/style>\n\n<div class=\"wp_blog_container wp_blog_theme\">\n  <button id=\"blogNotesThemeToggle\" class=\"wp_blog_toggle-btn\">\ud83c\udf19<\/button>\n  <h1 class=\"wp_blog_main-heading\"><\/h1>\n\n  <div class=\"wp_blog_explanation\">\n    <h2>Code<\/h2>\n    <div class=\"wp_blog_code-tabs-container\">\n      <div class=\"wp_blog_code-tabs-header\">\n      <button class=\"wp_blog_code-tab-button active\" data-lang=\"js\">JavaScript<\/button>\n      <button class=\"wp_blog_code-tab-button\" data-lang=\"py\">Python<\/button>\n      <button class=\"wp_blog_code-tab-button\" data-lang=\"java\">Java<\/button>\n      <button class=\"wp_blog_code-tab-button\" data-lang=\"cpp\">C++<\/button>\n      <button class=\"wp_blog_code-tab-button\" data-lang=\"c\">C<\/button>\n      <button class=\"wp_blog_code-tab-button\" data-lang=\"cs\">C#<\/button>\n    <\/div>\n    <div class=\"wp_blog_code-tab-content active\" data-lang=\"js\">\n    <pre>\n  function bellmanFord(edges, V, src) {\n    const dist = new Array(V).fill(Infinity);\n    dist[src] = 0;\n\n    \/\/ Relax edges V-1 times\n    for (let i = 0; i < V - 1; i++) {\n        let updated = false;\n\n        for (let [u, v, w] of edges) {\n            if (dist[u] !== Infinity &#038;&#038; dist[u] + w < dist[v]) {\n                dist[v] = dist[u] + w;\n                updated = true;\n            }\n        }\n\n        \/\/ Early stopping if no update happened\n        if (!updated) break;\n    }\n\n    \/\/ Check for negative weight cycle\n    for (let [u, v, w] of edges) {\n        if (dist[u] !== Infinity &#038;&#038; dist[u] + w < dist[v]) {\n            console.log(\"Negative Weight cycle Detected\");\n            return null;\n        }\n    }\n\n    return dist;\n}\n\n\/\/ Edge list: [u, v, w]\nconst edges = [\n    [0, 1, 6],\n    [0, 2, 5],\n    [0, 3, 5],\n    [1, 4, -1],\n    [2, 1, -2],\n    [2, 4, 1],\n    [3, 2, -2],\n    [3, 5, -1],\n    [4, 6, 3],\n    [5, 6, 3]\n];\n\n\/\/ Example for negative cycle case\n\/*\nconst edges = [\n    [0, 1, 4],\n    [1, 2, -1],\n    [2, 3, -2],\n    [3, 1, 0]\n];\n*\/\n\nconst V = 7;\nconsole.log(bellmanFord(edges, V, 0));\n    <\/pre>\n    <\/div>\n\n    <div class=\"wp_blog_code-tab-content\" data-lang=\"py\">\n    <pre>\n    def bellman_ford(edges, V, src):\n    dist = [float('inf')] * V\n    dist[src] = 0\n\n    # Relax edges V-1 times\n    for _ in range(V - 1):\n        updated = False\n        for u, v, w in edges:\n            if dist[u] != float('inf') and dist[u] + w < dist[v]:\n                dist[v] = dist[u] + w\n                updated = True\n        if not updated:\n            break\n\n    # Check for negative weight cycle\n    for u, v, w in edges:\n        if dist[u] != float('inf') and dist[u] + w < dist[v]:\n            print(\"Negative Weight cycle Detected\")\n            return None\n\n    return dist\n\n\nedges = [\n    (0, 1, 6),\n    (0, 2, 5),\n    (0, 3, 5),\n    (1, 4, -1),\n    (2, 1, -2),\n    (2, 4, 1),\n    (3, 2, -2),\n    (3, 5, -1),\n    (4, 6, 3),\n    (5, 6, 3)\n]\n\nV = 7\nprint(bellman_ford(edges, V, 0))\n\n    <\/pre>  \n    <\/div>\n\n    <div class=\"wp_blog_code-tab-content\" data-lang=\"java\">\n    <pre>\nimport java.util.*;\n   class Solution {\n    static int[] bellmanFord(int[][] edges, int V, int src) {\n        int[] dist = new int[V];\n        Arrays.fill(dist, Integer.MAX_VALUE);\n        dist[src] = 0;\n\n        for (int i = 0; i < V - 1; i++) {\n            boolean updated = false;\n            for (int[] e : edges) {\n                int u = e[0], v = e[1], w = e[2];\n                if (dist[u] != Integer.MAX_VALUE &#038;&#038; dist[u] + w < dist[v]) {\n                    dist[v] = dist[u] + w;\n                    updated = true;\n                }\n            }\n            if (!updated) break;\n        }\n        for (int[] e : edges) {\n            int u = e[0], v = e[1], w = e[2];\n            if (dist[u] != Integer.MAX_VALUE &#038;&#038; dist[u] + w < dist[v]) {\n                System.out.println(\"Negative Weight cycle Detected\");\n                return null;\n            }\n        }\n        return dist;\n    }\n    public static void main(String[] args) {\n        int[][] edges = {\n            {0, 1, 6},\n            {0, 2, 5},\n            {0, 3, 5},\n            {1, 4, -1},\n            {2, 1, -2},\n            {2, 4, 1},\n            {3, 2, -2},\n            {3, 5, -1},\n            {4, 6, 3},\n            {5, 6, 3}\n        };\n        int V = 7;\n        System.out.println(Arrays.toString(bellmanFord(edges, V, 0)));\n    }\n}\n    <\/pre>\n    <\/div>\n\n    <div class=\"wp_blog_code-tab-content\" data-lang=\"cpp\">\n  <pre>\n#include &lt;bits\/stdc++.h&gt;\nusing namespace std;\n\nvector<int> bellmanFord(vector<vector<int>>& edges, int V, int src) {\n    vector<int> dist(V, INT_MAX);\n    dist[src] = 0;\n\n    for (int i = 0; i < V - 1; i++) {\n        bool updated = false;\n        for (auto &#038;e : edges) {\n            int u = e[0], v = e[1], w = e[2];\n            if (dist[u] != INT_MAX &#038;&#038; dist[u] + w < dist[v]) {\n                dist[v] = dist[u] + w;\n                updated = true;\n            }\n        }\n        if (!updated) break;\n    }\n\n    for (auto &#038;e : edges) {\n        int u = e[0], v = e[1], w = e[2];\n        if (dist[u] != INT_MAX &#038;&#038; dist[u] + w < dist[v]) {\n            cout << \"Negative Weight cycle Detected\" << endl;\n            return {};\n        }\n    }\n    return dist;\n}\n\nint main() {\n    vector<vector<int>> edges = {\n        {0,1,6},{0,2,5},{0,3,5},{1,4,-1},\n        {2,1,-2},{2,4,1},{3,2,-2},\n        {3,5,-1},{4,6,3},{5,6,3}\n    };\n\n    int V = 7;\n    vector<int> res = bellmanFord(edges, V, 0);\n    for (int x : res) cout << x << \" \";\n}\n\n  <\/pre>\n    <\/div>\n    <div class=\"wp_blog_code-tab-content\" data-lang=\"c\">\n      <pre>\n#include &lt;stdio.h&gt;\n#include &lt;limits.h&gt;\n\ntypedef struct {\n    int u, v, w;\n} Edge;\n\nint main() {\n    int V = 7, E = 10, src = 0;\n    Edge edges[] = {\n        {0,1,6},{0,2,5},{0,3,5},{1,4,-1},\n        {2,1,-2},{2,4,1},{3,2,-2},\n        {3,5,-1},{4,6,3},{5,6,3}\n    };\n\n    int dist[V];\n    for (int i = 0; i < V; i++)\n        dist[i] = INT_MAX;\n    dist[src] = 0;\n\n    for (int i = 0; i < V - 1; i++) {\n        int updated = 0;\n        for (int j = 0; j < E; j++) {\n            int u = edges[j].u;\n            int v = edges[j].v;\n            int w = edges[j].w;\n\n            if (dist[u] != INT_MAX &#038;&#038; dist[u] + w < dist[v]) {\n                dist[v] = dist[u] + w;\n                updated = 1;\n            }\n        }\n        if (!updated) break;\n    }\n\n    for (int j = 0; j < E; j++) {\n        int u = edges[j].u;\n        int v = edges[j].v;\n        int w = edges[j].w;\n\n        if (dist[u] != INT_MAX &#038;&#038; dist[u] + w < dist[v]) {\n            printf(\"Negative Weight cycle Detected\\n\");\n            return 0;\n        }\n    }\n\n    for (int i = 0; i < V; i++)\n        printf(\"%d \", dist[i]);\n\n    return 0;\n}\n<\/pre>\n    <\/div>\n\n    <div class=\"wp_blog_code-tab-content\" data-lang=\"cs\">\n    <pre>\nusing System;\n\nclass Solution {\n    static int[] BellmanFord(int[,] edges, int V, int src) {\n        int[] dist = new int[V];\n        Array.Fill(dist, int.MaxValue);\n        dist[src] = 0;\n\n        int E = edges.GetLength(0);\n\n        for (int i = 0; i < V - 1; i++) {\n            bool updated = false;\n            for (int j = 0; j < E; j++) {\n                int u = edges[j, 0];\n                int v = edges[j, 1];\n                int w = edges[j, 2];\n\n                if (dist[u] != int.MaxValue &#038;&#038; dist[u] + w < dist[v]) {\n                    dist[v] = dist[u] + w;\n                    updated = true;\n                }\n            }\n            if (!updated) break;\n        }\n\n        for (int j = 0; j < E; j++) {\n            int u = edges[j, 0];\n            int v = edges[j, 1];\n            int w = edges[j, 2];\n\n            if (dist[u] != int.MaxValue &#038;&#038; dist[u] + w < dist[v]) {\n                Console.WriteLine(\"Negative Weight cycle Detected\");\n                return null;\n            }\n        }\n        return dist;\n    }\n\n    static void Main() {\n        int[,] edges = {\n            {0,1,6},{0,2,5},{0,3,5},{1,4,-1},\n            {2,1,-2},{2,4,1},{3,2,-2},\n            {3,5,-1},{4,6,3},{5,6,3}\n        };\n\n        int V = 7;\n        var res = BellmanFord(edges, V, 0);\n        if (res != null)\n            Console.WriteLine(string.Join(\" \", res));\n    }\n}\n\n<\/pre>\n    <\/div>\n  <\/div>\n    <h2>Time Complexity: <code>O(V x E) = O(n<sup>2<\/sup>)<\/code><\/h2>\n    <p>If we assume: V = n and E = n<\/p>\n    <h2>Space Complexity: <code>O(V)<\/code><\/h2>\n<\/div>  \n<\/div>\n<script>\ndocument.addEventListener(\"DOMContentLoaded\", () => {\n  const buttons = document.querySelectorAll(\".wp_blog_code-tab-button\");\n  const contents = document.querySelectorAll(\".wp_blog_code-tab-content\");\n\n  buttons.forEach((button) => {\n    button.addEventListener(\"click\", () => {\n      const lang = button.getAttribute(\"data-lang\");\n\n      buttons.forEach((btn) => btn.classList.remove(\"active\"));\n      contents.forEach((content) => content.classList.remove(\"active\"));\n\n      button.classList.add(\"active\");\n      document\n        .querySelector(`.wp_blog_code-tab-content[data-lang=\"${lang}\"]`)\n        .classList.add(\"active\");\n    });\n  });\n\n  const themeToggle = document.getElementById(\"blogNotesThemeToggle\");\n  const themeContainer = document.querySelector(\".wp_blog_theme\");\n\n  themeToggle.addEventListener(\"click\", () => {\n    themeContainer.classList.toggle(\"dark-mode\");\n    themeToggle.textContent =\n      themeContainer.classList.contains(\"dark-mode\") ? \"\u2600\ufe0f\" : \"\ud83c\udf19\";\n  });\n});\n<\/script>\n\n","protected":false},"excerpt":{"rendered":"<p>\ud83c\udf19 Code JavaScript Python Java C++ C C# function bellmanFord(edges, V, src) { const dist = new Array(V).fill(Infinity); dist[src] = 0; \/\/ Relax edges V-1 times for (let i = 0; i < V - 1; i++) { let updated = false; for (let [u, v, w] of edges) { if (dist[u] !== Infinity &#038;&#038;\n<\/p>\n","protected":false},"author":108,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[210,322,260,176,175,211,810,174,172,173],"tags":[],"class_list":["post-11316","post","type-post","status-publish","format-standard","category-algorithms","category-algorithms-and-data-structures","category-c-c-plus-plus","category-csharp","category-cplusplus","category-data-structures","category-dsa","category-java","category-javascript","category-python"],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/11316","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/users\/108"}],"replies":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/comments?post=11316"}],"version-history":[{"count":4,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/11316\/revisions"}],"predecessor-version":[{"id":11443,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/11316\/revisions\/11443"}],"wp:attachment":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/media?parent=11316"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/categories?post=11316"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/tags?post=11316"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}