🕷️ Crawler Inspector

URL Lookup

Direct Parameter Lookup

Raw Queries and Responses

1. Shard Calculation

Query:

Response:

Calculated Shard: 111 (from laksa089)

2. Crawled Status Check

Query:

curl -X POST \
  'http://laksa111.int.ahrefs:8124/' \
  -H 'Content-Type: text/plain' \
  -H 'X-ClickHouse-Database: crawler3' \
  -H 'Authorization: Basic YXBpOg==' \
  -d 'SELECT getAhrefsURLFromUnparsed(src_unparsed) AS found_url, ifNull(toUnixTimestamp(download_stamp), 0) AS crawl_time, ifNull(toUnixTimestamp(props_url_first_seen), 0) AS first_indexed_time, download_http_code AS http_code, src_unparsed AS src_unparsed, src_root_hash AS src_root_hash, history_drop_reason AS history_drop_reason, meta_title AS meta_title, meta_descriptions AS meta_descriptions, attrs_boilerpipe_text AS attrs_boilerpipe_text, attrs_markdown AS attrs_markdown, attrs_readable_markdown AS attrs_readable_markdown, meta_canonical AS meta_canonical FROM crawler3.page_info_local FINAL PREWHERE (src_root_hash, src_unparsed) IN ((getAhrefsRootHashFromUnparsed(getAhrefsUnparsedNoserviceFromURL(\'https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/\')), getAhrefsUnparsedNoserviceFromURL(\'https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/\'))) FORMAT JSONEachRow'

Response:

{"found_url":"https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/","crawl_time":1775773037,"first_indexed_time":1748258577,"http_code":200,"src_unparsed":"in,iquanta!www,\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/ s443","src_root_hash":"15211331546999444711","history_drop_reason":null,"meta_title":"Bellman-Ford Algorithm: Complete Guide with Python Code - iQuanta","meta_descriptions":["The Bellman-Ford Algorithm is a fundamental concept in graph theory especially it is useful when dealing with graphs that have negative...."],"attrs_boilerpipe_text":"Bellman-Ford Algorithm\nThe Bellman-Ford Algorithm is a fundamental concept in graph theory especially it is useful when dealing with graphs that have negative weight edges. While many people are familiar with Dijkstra’s Algorithm for finding the shortest path that does not work correctly when negative weights are involved.\nThat is where Bellman-Ford Algorithm comes in. It allows you to find the shortest paths from a single starting point to all other nodes in a graph even if some of the paths include negative edge weights. Although it is not the fastest algorithm out there but it has the ability to handle more complex graphs makes it valuable in real-world scenarios like network routing or financial analysis.\nIn this article we will break down how the algorithm works and how to compare it to Dijkstra’s algorithm along with exploring its time complexity, walk through a Python implementation, and look at some practical use cases that all explained in a simple and easy manner.\nTable of Contents\nWhat is Bellman-Ford Algorithm?\nKey Features of Bellman-Ford Algorithm\nHow Does the Bellman-Ford Algorithm Work?\nBellman-Ford vs Dijkstra Algorithm\nBellman-Ford Algorithm Python Code\nReal-World Applications of Bellman-Ford Algorithm\nFrequently Asked Questions (Bellman-Ford Algorithm)\nWhat is the Bellman-Ford Algorithm used for?\nCan Bellman-Ford work with negative numbers?\nWhat is a negative weight cycle?\nIs Bellman-Ford better than Dijkstra?\nWhere is Bellman-Ford used in real life?\nThe Bellman-Ford Algorithm is a simple way to find the shortest path from one place (called the source node) to every other place in a network or graph. Imagine a\ngraph\nas a bunch of points connected by lines. Each line has a number on it that could represent distance, time, or cost, how much it takes to travel from one point to another.\nNow here is what makes Bellman-Ford different from other algorithms. It can work even when some of those numbers are negative. That means if moving from one point to another actually reduces your total cost and Bellman-Ford can still handle it.\nKey Features of Bellman-Ford Algorithm\nFinds the shortest path from a single source to all other nodes.\nWorks even if the graph has negative edge weights.\nCan detect negative weight cycles in the graph.\nEasier to understand and implement than some other algorithms.\nSlower than Dijkstra’s for large graphs but more flexible.\nHow Does the Bellman-Ford Algorithm Work?\nThe Bellman-Ford Algorithm works by finding the shortest way to reach every node from a starting node. First, it sets the distance to the starting node as 0 and to all other nodes as very large because we don not know their distances yet. Then it goes through all the connections (edges) in the graph again and again. Each time it checks if going through one node to reach another gives a shorter path. If it finds a shorter way then it will updates the distance.\nThis process is repeated many times usually one less than the number of nodes in the graph. At the end the algorithm has the shortest distance to each node. It also checks if there is a cycle where the total distance keeps getting smaller, which would mean the graph has a negative weight cycle.\nBellman-Ford vs Dijkstra Algorithm\nFeature\nBellman-Ford Algorithm\nDijkstra\nHandles Negative Weights\nYes\nNo\nTime Complexity\nO(V × E)\nO((V + E) log V) with heap\nDetects Negative Cycles\nYes\nNo\nEfficiency\nSlower\nFaster\nBellman-Ford Algorithm Python Code\ndef bellman_ford(graph, V, E, source):\r\n    distance = [float(\"inf\")] * V\r\n    distance[source] = 0\r\n\r\n    for _ in range(V - 1):\r\n        for u, v, w in graph:\r\n            if distance[u] != float(\"inf\") and distance[u] + w < distance[v]:\r\n                distance[v] = distance[u] + w\r\n\r\n    for u, v, w in graph:\r\n        if distance[u] != float(\"inf\") and distance[u] + w < distance[v]:\r\n            print(\"Graph contains negative weight cycle\")\r\n            return None\r\n\r\n    print(\"Vertex Distance from Source:\")\r\n    for i in range(V):\r\n        print(f\"{i} \\t\\t {distance[i]}\")\r\n    return distance\r\n\r\nV = 5\r\nE = 8\r\ngraph = [\r\n    (0, 1, -1),\r\n    (0, 2, 4),\r\n    (1, 2, 3),\r\n    (1, 3, 2),\r\n    (1, 4, 2),\r\n    (3, 2, 5),\r\n    (3, 1, 1),\r\n    (4, 3, -3)\r\n]\r\n\r\nbellman_ford(graph, V, E, 0)\nReal-World Applications of Bellman-Ford Algorithm\nUsed in network routing protocols like RIP (Routing Information Protocol).\nHelps detect negative weight cycles in financial fraud detection systems.\nUsed in transportation systems to find the cheapest or fastest route.\nUseful in currency exchange to detect arbitrage opportunities.\nApplied in game development for AI pathfinding in weighted maps.\nFrequently Asked Questions (Bellman-Ford Algorithm)\nWhat is the Bellman-Ford Algorithm used for?\nIt is used to find the shortest path from one point to all other points in a graph.\nCan Bellman-Ford work with negative numbers?\nYes, it works even if some paths have negative weights.\nWhat is a negative weight cycle?\nIt is a loop where the total path cost keeps getting smaller, forever.\nIs Bellman-Ford better than Dijkstra?\nBellman-Ford is slower but works in more cases like with negative weights.\nWhere is Bellman-Ford used in real life?\nIt is used in maps, internet routing, currency exchange, and games.","attrs_markdown":"- [About Us](http:\/\/iquanta.in\/)\n- [Success Stories](http:\/\/iquanta.in\/)\n- [Privacy Policy and Terms](http:\/\/iquanta.in\/)\n- [contact Us](http:\/\/iquanta.in\/)\n\n[Flat 4000\/- off on CAT 2026 Courses. Use Code JEET26](https:\/\/www.iquanta.in\/ \"Flat 4000\/- off on CAT 2026 Courses. Use Code JEET26\")\n\n[Join CAT Whatsapp Group](https:\/\/chat.whatsapp.com\/JX9Yl1HSTsN7DcpWh5kDOK \"Join CAT Whatsapp Group\")\n\n[Free CAT Study Material\\!](https:\/\/www.iquanta.in\/free-cat-study-material \"Free CAT Study Material!\")\n\n[![Logo](https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2023\/05\/iQuanta-White-Logo-1.png)](https:\/\/www.iquanta.in\/blog\/)\n\n[IIM Call Predictor](https:\/\/www.iquanta.in\/iim-call-predictor \"IIM Call Predictor\")\n\n[Flat 4000\/- off on CAT 2026 Courses. Use Code JEET26](https:\/\/www.iquanta.in\/ \"Flat 4000\/- off on CAT 2026 Courses. Use Code JEET26\")\n\n[Join CAT Whatsapp Group](https:\/\/chat.whatsapp.com\/JX9Yl1HSTsN7DcpWh5kDOK \"Join CAT Whatsapp Group\")\n\n[Download CAT Syllabus & Strategy](https:\/\/media.iquanta.in\/pdfs\/CAT+Syllabus+2026-27+by+iQuanta.pdf \"Download CAT Syllabus & Strategy\")\n\n[Download VARC Cheat Sheet](https:\/\/media.iquanta.in\/ui_images\/VA-RC.pdf \"Download VARC Cheat Sheet\")\n\n[Download CAT Quant Formula PDF](https:\/\/media.iquanta.in\/ui_images\/iQuanta+Quant+Formulae+eBook+.pdf \"Download CAT Quant Formula PDF\")\n\n[Free CAT Study Material](https:\/\/www.iquanta.in\/free-cat-study-material \"Free CAT Study Material\")\n\n[![Logo](https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2023\/05\/iQuanta-White-Logo-1.png)](https:\/\/www.iquanta.in\/)\n\n[IIM Call Predictor](https:\/\/www.iquanta.in\/iim-call-predictor \"IIM Call Predictor\")\n\n- [Home](https:\/\/www.iquanta.in\/)\n- [CAT & Non-CAT](https:\/\/www.iquanta.in\/blog\/category\/cat-non-cat\/)\n  - [CAT Exam](https:\/\/www.iquanta.in\/blog\/category\/cat-non-cat\/cat-exam\/)\n  - [MBA Specialization](https:\/\/www.iquanta.in\/blog\/category\/mba\/mba-specialization\/)\n  - [MBA Preparation Tips](https:\/\/www.iquanta.in\/blog\/category\/mba-exams\/mba-preparation-tips\/)\n  - [Bschools Information](https:\/\/www.iquanta.in\/blog\/category\/cat-non-cat\/b-school\/)\n    - [Top B-Schools](https:\/\/www.iquanta.in\/blog\/category\/cat-non-cat\/b-school\/top-b-schools\/)\n    - [Bschool placements](https:\/\/www.iquanta.in\/blog\/category\/cat-non-cat\/b-school\/bschool-placements\/)\n    - [Bschool Interview Experiences](https:\/\/www.iquanta.in\/blog\/category\/cat-non-cat\/bschool-interview-experiences\/)\n- [IIT-JEE & NEET](https:\/\/www.iquanta.in\/blog\/category\/jee-neet\/)\n  - [IIT JEE](https:\/\/www.iquanta.in\/blog\/category\/iit-jee\/)\n  - [NEET](https:\/\/www.iquanta.in\/blog\/category\/neet\/)\n- [CUET & After 12th](https:\/\/www.iquanta.in\/blog\/category\/after-12th\/)\n  - [CUET Exam](https:\/\/www.iquanta.in\/blog\/category\/after-12th\/cuet-exam\/)\n  - [IPMAT](https:\/\/www.iquanta.in\/blog\/category\/after-12th\/ipmat\/)\n  - [CLAT](https:\/\/www.iquanta.in\/blog\/category\/law\/clat\/)\n- [Study Abroad](https:\/\/www.iquanta.in\/blog\/category\/gmat-study-abraod\/)\n  - [GMAT Exam](https:\/\/www.iquanta.in\/blog\/category\/gmat-study-abraod\/gmat-exam\/)\n  - [IELTS Exam](https:\/\/www.iquanta.in\/blog\/category\/gmat-study-abraod\/ielts-exam\/)\n- [Others](https:\/\/www.iquanta.in\/blog\/category\/others\/)\n  - [iQuanta’s Features](https:\/\/www.iquanta.in\/blog\/category\/others\/iquantas-features\/)\n  - [General Awareness](https:\/\/www.iquanta.in\/blog\/category\/others\/general-knowledge\/)\n  - [Motivation](https:\/\/www.iquanta.in\/blog\/category\/others\/motivation\/)\n  - [Bank Exam](https:\/\/www.iquanta.in\/blog\/category\/others\/bank-exam\/)\n  - [UPSC Exam](https:\/\/www.iquanta.in\/blog\/category\/others\/upsc-exam\/)\n  - [Design](https:\/\/www.iquanta.in\/blog\/category\/design\/)\n\n[Past Papers](https:\/\/www.iquanta.in\/test\/cat-previous-papers \"Past Papers\")\n\n[Home](https:\/\/www.iquanta.in\/blog\/)  [iSkills](https:\/\/www.iquanta.in\/blog\/category\/iskills\/ \"View all posts in iSkills\")  [DSA and Competitive Programming](https:\/\/www.iquanta.in\/blog\/category\/iskills\/dsa-competitive-programming\/ \"View all posts in DSA and Competitive Programming\")  Bellman-Ford Algorithm: Complete Guide with Python Code\n\n# Bellman-Ford Algorithm: Complete Guide with Python Code\nBy\n\n[Nidhi Goswami](https:\/\/www.iquanta.in\/blog\/author\/nidhigoswami\/)\n\n\\-\n\nMay 26, 2025\n\n[0](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#respond)\n\n67\n\n[Facebook](https:\/\/www.facebook.com\/sharer.php?u=https%3A%2F%2Fwww.iquanta.in%2Fblog%2Fbellman-ford-algorithm-complete-guide-with-python-code%2F \"Facebook\")\n\n[Twitter](https:\/\/twitter.com\/intent\/tweet?text=Bellman-Ford+Algorithm%3A+Complete+Guide+with+Python+Code&url=https%3A%2F%2Fwww.iquanta.in%2Fblog%2Fbellman-ford-algorithm-complete-guide-with-python-code%2F&via=iQuanta \"Twitter\")\n\n[Pinterest](https:\/\/pinterest.com\/pin\/create\/button\/?url=https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/&media=https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/Your-paragraph-text-22.png&description=The%20Bellman-Ford%20Algorithm%20is%20a%20fundamental%20concept%20in%20graph%20theory%20especially%20it%20is%20useful%20when%20dealing%20with%20graphs%20that%20have%20negative.... \"Pinterest\")\n\n[WhatsApp](https:\/\/api.whatsapp.com\/send?text=Bellman-Ford+Algorithm%3A+Complete+Guide+with+Python+Code%20%0A%0A%20https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/ \"WhatsApp\")\n\n[![Bellman-Ford Algorithm](https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/Your-paragraph-text-22-696x392.png)](https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/Your-paragraph-text-22.png)\n\nBellman-Ford Algorithm\n\nThe Bellman-Ford Algorithm is a fundamental concept in graph theory especially it is useful when dealing with graphs that have negative weight edges. While many people are familiar with Dijkstra’s Algorithm for finding the shortest path that does not work correctly when negative weights are involved.\n\nThat is where Bellman-Ford Algorithm comes in. It allows you to find the shortest paths from a single starting point to all other nodes in a graph even if some of the paths include negative edge weights. Although it is not the fastest algorithm out there but it has the ability to handle more complex graphs makes it valuable in real-world scenarios like network routing or financial analysis.\n\nIn this article we will break down how the algorithm works and how to compare it to Dijkstra’s algorithm along with exploring its time complexity, walk through a Python implementation, and look at some practical use cases that all explained in a simple and easy manner.\n\nTable of Contents\n\n[Toggle](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/)\n\n- [What is Bellman-Ford Algorithm?](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#What_is_Bellman-Ford_Algorithm)\n- [Key Features of Bellman-Ford Algorithm](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#Key_Features_of_Bellman-Ford_Algorithm)\n- [How Does the Bellman-Ford Algorithm Work?](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#How_Does_the_Bellman-Ford_Algorithm_Work)\n- [Bellman-Ford vs Dijkstra Algorithm](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#Bellman-Ford_vs_Dijkstra_Algorithm)\n- [Bellman-Ford Algorithm Python Code](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#Bellman-Ford_Algorithm_Python_Code)\n- [Real-World Applications of Bellman-Ford Algorithm](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#Real-World_Applications_of_Bellman-Ford_Algorithm)\n- [Frequently Asked Questions (Bellman-Ford Algorithm)](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#Frequently_Asked_Questions_Bellman-Ford_Algorithm)\n  - [What is the Bellman-Ford Algorithm used for?](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#What_is_the_Bellman-Ford_Algorithm_used_for)\n  - [Can Bellman-Ford work with negative numbers?](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#Can_Bellman-Ford_work_with_negative_numbers)\n  - [What is a negative weight cycle?](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#What_is_a_negative_weight_cycle)\n  - [Is Bellman-Ford better than Dijkstra?](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#Is_Bellman-Ford_better_than_Dijkstra)\n  - [Where is Bellman-Ford used in real life?](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#Where_is_Bellman-Ford_used_in_real_life)\n## **What is Bellman-Ford Algorithm?**\nThe Bellman-Ford Algorithm is a simple way to find the shortest path from one place (called the source node) to every other place in a network or graph. Imagine a [graph](https:\/\/www.iquanta.in\/blog\/graph-data-structure-its-types-and-representation\/) as a bunch of points connected by lines. Each line has a number on it that could represent distance, time, or cost, how much it takes to travel from one point to another.\n\nNow here is what makes Bellman-Ford different from other algorithms. It can work even when some of those numbers are negative. That means if moving from one point to another actually reduces your total cost and Bellman-Ford can still handle it.\n\n## **Key Features of Bellman-Ford Algorithm**\n1. Finds the shortest path from a single source to all other nodes.\n2. Works even if the graph has negative edge weights.\n3. Can detect negative weight cycles in the graph.\n4. Easier to understand and implement than some other algorithms.\n5. Slower than Dijkstra’s for large graphs but more flexible.\n## **How Does the Bellman-Ford Algorithm Work?**\nThe Bellman-Ford Algorithm works by finding the shortest way to reach every node from a starting node. First, it sets the distance to the starting node as 0 and to all other nodes as very large because we don not know their distances yet. Then it goes through all the connections (edges) in the graph again and again. Each time it checks if going through one node to reach another gives a shorter path. If it finds a shorter way then it will updates the distance.\n\nThis process is repeated many times usually one less than the number of nodes in the graph. At the end the algorithm has the shortest distance to each node. It also checks if there is a cycle where the total distance keeps getting smaller, which would mean the graph has a negative weight cycle.\n\n## **Bellman-Ford vs Dijkstra Algorithm**\n|   |   |   |\n|---|---|---|\n| **Feature** | **Bellman-Ford Algorithm** | **Dijkstra** |\n| Handles Negative Weights | Yes | No |\n| Time Complexity | O(V × E) | O((V + E) log V) with heap |\n| Detects Negative Cycles | Yes | No |\n| Efficiency | Slower | Faster |\n## **Bellman-Ford Algorithm Python Code**\n```\ndef bellman_ford(graph, V, E, source):\r\n    distance = [float(\"inf\")] * V\r\n    distance[source] = 0\r\n\r\n    for _ in range(V - 1):\r\n        for u, v, w in graph:\r\n            if distance[u] != float(\"inf\") and distance[u] + w < distance[v]:\r\n                distance[v] = distance[u] + w\r\n\r\n    for u, v, w in graph:\r\n        if distance[u] != float(\"inf\") and distance[u] + w < distance[v]:\r\n            print(\"Graph contains negative weight cycle\")\r\n            return None\r\n\r\n    print(\"Vertex Distance from Source:\")\r\n    for i in range(V):\r\n        print(f\"{i} \\t\\t {distance[i]}\")\r\n    return distance\r\n\r\nV = 5\r\nE = 8\r\ngraph = [\r\n    (0, 1, -1),\r\n    (0, 2, 4),\r\n    (1, 2, 3),\r\n    (1, 3, 2),\r\n    (1, 4, 2),\r\n    (3, 2, 5),\r\n    (3, 1, 1),\r\n    (4, 3, -3)\r\n]\r\n\r\nbellman_ford(graph, V, E, 0)\n```\n## **Real-World Applications of Bellman-Ford Algorithm**\n1. Used in network routing protocols like RIP (Routing Information Protocol).\n2. Helps detect negative weight cycles in financial fraud detection systems.\n3. Used in transportation systems to find the cheapest or fastest route.\n4. Useful in currency exchange to detect arbitrage opportunities.\n5. Applied in game development for AI pathfinding in weighted maps.\n## **Frequently Asked Questions (Bellman-Ford Algorithm)**\n### **What is the Bellman-Ford Algorithm used for?**\nIt is used to find the shortest path from one point to all other points in a graph.\n\n### **Can Bellman-Ford work with negative numbers?**\nYes, it works even if some paths have negative weights.\n\n### **What is a negative weight cycle?**\nIt is a loop where the total path cost keeps getting smaller, forever.\n\n### **Is Bellman-Ford better than Dijkstra?**\nBellman-Ford is slower but works in more cases like with negative weights.\n\n### **Where is Bellman-Ford used in real life?**\nIt is used in maps, internet routing, currency exchange, and games.\n\n[Facebook](https:\/\/www.facebook.com\/sharer.php?u=https%3A%2F%2Fwww.iquanta.in%2Fblog%2Fbellman-ford-algorithm-complete-guide-with-python-code%2F \"Facebook\")\n\n[Twitter](https:\/\/twitter.com\/intent\/tweet?text=Bellman-Ford+Algorithm%3A+Complete+Guide+with+Python+Code&url=https%3A%2F%2Fwww.iquanta.in%2Fblog%2Fbellman-ford-algorithm-complete-guide-with-python-code%2F&via=iQuanta \"Twitter\")\n\n[Pinterest](https:\/\/pinterest.com\/pin\/create\/button\/?url=https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/&media=https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/Your-paragraph-text-22.png&description=The%20Bellman-Ford%20Algorithm%20is%20a%20fundamental%20concept%20in%20graph%20theory%20especially%20it%20is%20useful%20when%20dealing%20with%20graphs%20that%20have%20negative.... \"Pinterest\")\n\n[WhatsApp](https:\/\/api.whatsapp.com\/send?text=Bellman-Ford+Algorithm%3A+Complete+Guide+with+Python+Code%20%0A%0A%20https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/ \"WhatsApp\")\n\nPrevious article[IIT Mandi Cutoff 2025 – Know the Expected Cutoff for all BTech Programs](https:\/\/www.iquanta.in\/blog\/iit-mandi-cutoff-2025\/)\n\nNext article[Top 7 Application of Graph in Data Structure with Examples](https:\/\/www.iquanta.in\/blog\/top-7-application-of-graph-in-data-structure-with-examples\/)\n\n[![Nidhi Goswami](https:\/\/secure.gravatar.com\/avatar\/21d234d87afd924b217d26b25a3cf1ee?s=96&d=mm&r=g)](https:\/\/www.iquanta.in\/blog\/author\/nidhigoswami\/)\n\n[Nidhi Goswami](https:\/\/www.iquanta.in\/blog\/author\/nidhigoswami\/)\n\n#### [RELATED ARTICLES](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/)[MORE FROM AUTHOR](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/)\n[![](data:image\/png;base64,iVBORw0KGgoAAAANSUhEUgAAANoAAACWAQMAAACCSQSPAAAAA1BMVEWurq51dlI4AAAAAXRSTlMmkutdmwAAABpJREFUWMPtwQENAAAAwiD7p7bHBwwAAAAg7RD+AAGXD7BoAAAAAElFTkSuQmCC)](https:\/\/www.iquanta.in\/blog\/top-10-applications-of-linked-list-data-structure-2025\/ \"Top 10 Applications of Linked List Data Structure [2025]\")\n\n### [Top 10 Applications of Linked List Data Structure \\[2025\\]](https:\/\/www.iquanta.in\/blog\/top-10-applications-of-linked-list-data-structure-2025\/ \"Top 10 Applications of Linked List Data Structure [2025]\")\n\n[![QuickSort Algorithm](data:image\/png;base64,iVBORw0KGgoAAAANSUhEUgAAANoAAACWAQMAAACCSQSPAAAAA1BMVEWurq51dlI4AAAAAXRSTlMmkutdmwAAABpJREFUWMPtwQENAAAAwiD7p7bHBwwAAAAg7RD+AAGXD7BoAAAAAElFTkSuQmCC)](https:\/\/www.iquanta.in\/blog\/quicksort-algorithm-working-time-complexity-advantages\/ \"QuickSort Algorithm: Working, Time Complexity & Advantages\")\n\n### [QuickSort Algorithm: Working, Time Complexity & Advantages](https:\/\/www.iquanta.in\/blog\/quicksort-algorithm-working-time-complexity-advantages\/ \"QuickSort Algorithm: Working, Time Complexity & Advantages\")\n\n[![](data:image\/png;base64,iVBORw0KGgoAAAANSUhEUgAAANoAAACWAQMAAACCSQSPAAAAA1BMVEWurq51dlI4AAAAAXRSTlMmkutdmwAAABpJREFUWMPtwQENAAAAwiD7p7bHBwwAAAAg7RD+AAGXD7BoAAAAAElFTkSuQmCC)](https:\/\/www.iquanta.in\/blog\/data-preprocessing-in-machine-learning-steps-advantages\/ \"Data Preprocessing in Machine Learning: Steps & Advantages\")\n\n### [Data Preprocessing in Machine Learning: Steps & Advantages](https:\/\/www.iquanta.in\/blog\/data-preprocessing-in-machine-learning-steps-advantages\/ \"Data Preprocessing in Machine Learning: Steps & Advantages\")\n\n#### Recent Posts\n- [IIM Rohtak IPM vs IIM Ranchi IPM: Key Differences, Fee Structure and Admission Process](https:\/\/www.iquanta.in\/blog\/iim-rohtak-ipm-vs-iim-ranchi-ipm\/)\n- [IPM Colleges Selection Weightage](https:\/\/www.iquanta.in\/blog\/ipm-colleges-selection-weightage\/)\n- [FMS Delhi Final Placements 2026 Out: Average Package INR 32.27 LPA, Highest CTC INR 1.1 Cr](https:\/\/www.iquanta.in\/blog\/fms-delhi-final-placements-2026-out\/)\n- [Minimum Percentage Required for CAT Exam – Can You Apply with Low Marks?](https:\/\/www.iquanta.in\/blog\/minimum-percentage-required-for-cat-exam\/)\n- [Top 50 MBA Colleges Average Age of the Batch](https:\/\/www.iquanta.in\/blog\/top-50-mba-colleges-average-age-of-the-batch\/)\n\n[![Logo](https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2023\/05\/iQuanta-White-Logo-1.png)](https:\/\/www.iquanta.in\/blog\/)\n\n© Indrajeet's iQuanta Edu Services Pvt Ltd.\n\n[Facebook](https:\/\/www.facebook.com\/iQuanta.in \"Facebook\")\n\n[Instagram](https:\/\/www.instagram.com\/iQuanta.in \"Instagram\")\n\n[Youtube](https:\/\/www.youtube.com\/channel\/UCJcXnTkWeIrXavsa_DUzq5w \"Youtube\")\n\n#### Our Courses\n- [CAT 2026 Course](https:\/\/www.iquanta.in\/cat-2026)\n- [CAT 2027 Course](https:\/\/www.iquanta.in\/cat-2027)\n- [IPMAT Online Course](https:\/\/www.iquanta.in\/ipmat)\n- [CLAT 2026 Course](https:\/\/www.iquanta.in\/clat-coaching)\n- [JEE 2026 Course](https:\/\/www.iquanta.in\/iit-jee-coaching)\n- [NEET 2026 Course](https:\/\/www.iquanta.in\/neet-coaching)\n\n#### After 12th\n- [IPMAT](https:\/\/www.iquanta.in\/blog\/category\/after-12th\/ipmat\/)\n  - [IPMAT Mini Mock Series](https:\/\/www.iquanta.in\/blog\/category\/after-12th\/ipmat\/ipmat-mini-mock-series\/)\n  - [IPMAT VARC](https:\/\/www.iquanta.in\/blog\/category\/after-12th\/ipmat\/ipmat-varc\/)\n  - [IPMAT LR](https:\/\/www.iquanta.in\/blog\/category\/after-12th\/ipmat\/ipmat-lr\/)\n- [CUET & After 12th](https:\/\/www.iquanta.in\/blog\/category\/after-12th\/)\n- [Law](https:\/\/www.iquanta.in\/blog\/category\/law\/)\n  - [CLAT](https:\/\/www.iquanta.in\/blog\/category\/law\/clat\/)\n    - [CLAT Mini Mock Series](https:\/\/www.iquanta.in\/blog\/category\/law\/clat\/clat-mini-mock-series\/)\n    - [CLAT DNA](https:\/\/www.iquanta.in\/blog\/category\/law\/clat\/clat-dna\/)\n    - [CLAT GK](https:\/\/www.iquanta.in\/blog\/category\/law\/clat\/clat-gk\/)\n    - [clat](https:\/\/www.iquanta.in\/blog\/category\/clat-2\/)\n- [IIT-JEE & NEET](https:\/\/www.iquanta.in\/blog\/category\/jee-neet\/)\n  - [NEET](https:\/\/www.iquanta.in\/blog\/category\/neet\/)\n  - [IIT JEE](https:\/\/www.iquanta.in\/blog\/category\/iit-jee\/)\n\n#### Popular Category\n- [CAT Exam1151](https:\/\/www.iquanta.in\/blog\/category\/cat-non-cat\/cat-exam\/)\n- [CAT & Non-CAT1055](https:\/\/www.iquanta.in\/blog\/category\/cat-non-cat\/)\n- [IIT-JEE & NEET393](https:\/\/www.iquanta.in\/blog\/category\/jee-neet\/)\n- [IIT JEE357](https:\/\/www.iquanta.in\/blog\/category\/iit-jee\/)\n- [CLAT352](https:\/\/www.iquanta.in\/blog\/category\/law\/clat\/)\n- [Law308](https:\/\/www.iquanta.in\/blog\/category\/law\/)\n\n#### Editor Picks\n### [IIM Rohtak IPM vs IIM Ranchi IPM: Key Differences, Fee Structure and Admission Process](https:\/\/www.iquanta.in\/blog\/iim-rohtak-ipm-vs-iim-ranchi-ipm\/ \"IIM Rohtak IPM vs IIM Ranchi IPM: Key Differences, Fee Structure and Admission Process\")\nApril 8, 2026\n\n[Home](https:\/\/www.iquanta.in\/blog)\n\nPast Papers\n\n[Result](https:\/\/www.iquanta.in\/results)\n\nSearch\n\n×\n\n- [IPMAT](https:\/\/www.iquanta.in\/blog\/category\/after-12th\/ipmat\/)\n  - [IPMAT Mini Mock Series](https:\/\/www.iquanta.in\/blog\/category\/after-12th\/ipmat\/ipmat-mini-mock-series\/)\n  - [IPMAT VARC](https:\/\/www.iquanta.in\/blog\/category\/after-12th\/ipmat\/ipmat-varc\/)\n  - [IPMAT LR](https:\/\/www.iquanta.in\/blog\/category\/after-12th\/ipmat\/ipmat-lr\/)\n- [CUET & After 12th](https:\/\/www.iquanta.in\/blog\/category\/after-12th\/)\n- [Law](https:\/\/www.iquanta.in\/blog\/category\/law\/)\n  - [CLAT](https:\/\/www.iquanta.in\/blog\/category\/law\/clat\/)\n    - [CLAT Mini Mock Series](https:\/\/www.iquanta.in\/blog\/category\/law\/clat\/clat-mini-mock-series\/)\n    - [CLAT DNA](https:\/\/www.iquanta.in\/blog\/category\/law\/clat\/clat-dna\/)\n    - [CLAT GK](https:\/\/www.iquanta.in\/blog\/category\/law\/clat\/clat-gk\/)\n    - [clat](https:\/\/www.iquanta.in\/blog\/category\/clat-2\/)\n- [IIT-JEE & NEET](https:\/\/www.iquanta.in\/blog\/category\/jee-neet\/)\n  - [NEET](https:\/\/www.iquanta.in\/blog\/category\/neet\/)\n  - [IIT JEE](https:\/\/www.iquanta.in\/blog\/category\/iit-jee\/)\n\n- Free Counselling\n  Get Free 1 on 1 Counselling\n- [Phone](tel:+917683043155 \"+917683043155\")","attrs_readable_markdown":"[![Bellman-Ford Algorithm](https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/Your-paragraph-text-22-696x392.png)](https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/Your-paragraph-text-22.png)\n\nBellman-Ford Algorithm\n\nThe Bellman-Ford Algorithm is a fundamental concept in graph theory especially it is useful when dealing with graphs that have negative weight edges. While many people are familiar with Dijkstra’s Algorithm for finding the shortest path that does not work correctly when negative weights are involved.\n\nThat is where Bellman-Ford Algorithm comes in. It allows you to find the shortest paths from a single starting point to all other nodes in a graph even if some of the paths include negative edge weights. Although it is not the fastest algorithm out there but it has the ability to handle more complex graphs makes it valuable in real-world scenarios like network routing or financial analysis.\n\nIn this article we will break down how the algorithm works and how to compare it to Dijkstra’s algorithm along with exploring its time complexity, walk through a Python implementation, and look at some practical use cases that all explained in a simple and easy manner.\n\nTable of Contents\n\n- [What is Bellman-Ford Algorithm?](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#What_is_Bellman-Ford_Algorithm)\n- [Key Features of Bellman-Ford Algorithm](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#Key_Features_of_Bellman-Ford_Algorithm)\n- [How Does the Bellman-Ford Algorithm Work?](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#How_Does_the_Bellman-Ford_Algorithm_Work)\n- [Bellman-Ford vs Dijkstra Algorithm](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#Bellman-Ford_vs_Dijkstra_Algorithm)\n- [Bellman-Ford Algorithm Python Code](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#Bellman-Ford_Algorithm_Python_Code)\n- [Real-World Applications of Bellman-Ford Algorithm](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#Real-World_Applications_of_Bellman-Ford_Algorithm)\n- [Frequently Asked Questions (Bellman-Ford Algorithm)](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#Frequently_Asked_Questions_Bellman-Ford_Algorithm)\n  - [What is the Bellman-Ford Algorithm used for?](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#What_is_the_Bellman-Ford_Algorithm_used_for)\n  - [Can Bellman-Ford work with negative numbers?](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#Can_Bellman-Ford_work_with_negative_numbers)\n  - [What is a negative weight cycle?](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#What_is_a_negative_weight_cycle)\n  - [Is Bellman-Ford better than Dijkstra?](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#Is_Bellman-Ford_better_than_Dijkstra)\n  - [Where is Bellman-Ford used in real life?](https:\/\/www.iquanta.in\/blog\/bellman-ford-algorithm-complete-guide-with-python-code\/#Where_is_Bellman-Ford_used_in_real_life)\n\nThe Bellman-Ford Algorithm is a simple way to find the shortest path from one place (called the source node) to every other place in a network or graph. Imagine a [graph](https:\/\/www.iquanta.in\/blog\/graph-data-structure-its-types-and-representation\/) as a bunch of points connected by lines. Each line has a number on it that could represent distance, time, or cost, how much it takes to travel from one point to another.\n\nNow here is what makes Bellman-Ford different from other algorithms. It can work even when some of those numbers are negative. That means if moving from one point to another actually reduces your total cost and Bellman-Ford can still handle it.\n\n## **Key Features of Bellman-Ford Algorithm**\n1. Finds the shortest path from a single source to all other nodes.\n2. Works even if the graph has negative edge weights.\n3. Can detect negative weight cycles in the graph.\n4. Easier to understand and implement than some other algorithms.\n5. Slower than Dijkstra’s for large graphs but more flexible.\n## **How Does the Bellman-Ford Algorithm Work?**\nThe Bellman-Ford Algorithm works by finding the shortest way to reach every node from a starting node. First, it sets the distance to the starting node as 0 and to all other nodes as very large because we don not know their distances yet. Then it goes through all the connections (edges) in the graph again and again. Each time it checks if going through one node to reach another gives a shorter path. If it finds a shorter way then it will updates the distance.\n\nThis process is repeated many times usually one less than the number of nodes in the graph. At the end the algorithm has the shortest distance to each node. It also checks if there is a cycle where the total distance keeps getting smaller, which would mean the graph has a negative weight cycle.\n\n## **Bellman-Ford vs Dijkstra Algorithm**\n|   |   |   |\n|---|---|---|\n| **Feature** | **Bellman-Ford Algorithm** | **Dijkstra** |\n| Handles Negative Weights | Yes | No |\n| Time Complexity | O(V × E) | O((V + E) log V) with heap |\n| Detects Negative Cycles | Yes | No |\n| Efficiency | Slower | Faster |\n## **Bellman-Ford Algorithm Python Code**\n```\ndef bellman_ford(graph, V, E, source):\r\n    distance = [float(\"inf\")] * V\r\n    distance[source] = 0\r\n\r\n    for _ in range(V - 1):\r\n        for u, v, w in graph:\r\n            if distance[u] != float(\"inf\") and distance[u] + w < distance[v]:\r\n                distance[v] = distance[u] + w\r\n\r\n    for u, v, w in graph:\r\n        if distance[u] != float(\"inf\") and distance[u] + w < distance[v]:\r\n            print(\"Graph contains negative weight cycle\")\r\n            return None\r\n\r\n    print(\"Vertex Distance from Source:\")\r\n    for i in range(V):\r\n        print(f\"{i} \\t\\t {distance[i]}\")\r\n    return distance\r\n\r\nV = 5\r\nE = 8\r\ngraph = [\r\n    (0, 1, -1),\r\n    (0, 2, 4),\r\n    (1, 2, 3),\r\n    (1, 3, 2),\r\n    (1, 4, 2),\r\n    (3, 2, 5),\r\n    (3, 1, 1),\r\n    (4, 3, -3)\r\n]\r\n\r\nbellman_ford(graph, V, E, 0)\n```\n## **Real-World Applications of Bellman-Ford Algorithm**\n1. Used in network routing protocols like RIP (Routing Information Protocol).\n2. Helps detect negative weight cycles in financial fraud detection systems.\n3. Used in transportation systems to find the cheapest or fastest route.\n4. Useful in currency exchange to detect arbitrage opportunities.\n5. Applied in game development for AI pathfinding in weighted maps.\n## **Frequently Asked Questions (Bellman-Ford Algorithm)**\n### **What is the Bellman-Ford Algorithm used for?**\nIt is used to find the shortest path from one point to all other points in a graph.\n\n### **Can Bellman-Ford work with negative numbers?**\nYes, it works even if some paths have negative weights.\n\n### **What is a negative weight cycle?**\nIt is a loop where the total path cost keeps getting smaller, forever.\n\n### **Is Bellman-Ford better than Dijkstra?**\nBellman-Ford is slower but works in more cases like with negative weights.\n\n### **Where is Bellman-Ford used in real life?**\nIt is used in maps, internet routing, currency exchange, and games.","meta_canonical":null}

3. Robots.txt Check

Query:

Response:

4. Spam/Ban Check

Query:

Response:

5. Seen Status Check

ℹ️ Skipped - page is already crawled

📄

INDEXABLE

✅

CRAWLED

2 days ago

🤖

ROBOTS ALLOWED

Page Info Filters

Filter	Status	Condition	Details
HTTP status	PASS	`download_http_code = 200`	HTTP 200
Age cutoff	PASS	`download_stamp > now() - 6 MONTH`	0.1 months ago
History drop	PASS	`isNull(history_drop_reason)`	No drop reason
Spam/ban	PASS	`fh_dont_index != 1 AND ml_spam_score = 0`	ml_spam_score=0
Canonical	PASS	`meta_canonical IS NULL OR = '' OR = src_unparsed`	Not set

Page Details

Property	Value
URL	https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/
Last Crawled	2026-04-09 22:17:17 (2 days ago)
First Indexed	2025-05-26 11:22:57 (10 months ago)
HTTP Status Code	200
Meta Title	Bellman-Ford Algorithm: Complete Guide with Python Code - iQuanta
Meta Description	The Bellman-Ford Algorithm is a fundamental concept in graph theory especially it is useful when dealing with graphs that have negative....
Meta Canonical	null
Boilerpipe Text	Bellman-Ford Algorithm The Bellman-Ford Algorithm is a fundamental concept in graph theory especially it is useful when dealing with graphs that have negative weight edges. While many people are familiar with Dijkstra’s Algorithm for finding the shortest path that does not work correctly when negative weights are involved. That is where Bellman-Ford Algorithm comes in. It allows you to find the shortest paths from a single starting point to all other nodes in a graph even if some of the paths include negative edge weights. Although it is not the fastest algorithm out there but it has the ability to handle more complex graphs makes it valuable in real-world scenarios like network routing or financial analysis. In this article we will break down how the algorithm works and how to compare it to Dijkstra’s algorithm along with exploring its time complexity, walk through a Python implementation, and look at some practical use cases that all explained in a simple and easy manner. Table of Contents What is Bellman-Ford Algorithm? Key Features of Bellman-Ford Algorithm How Does the Bellman-Ford Algorithm Work? Bellman-Ford vs Dijkstra Algorithm Bellman-Ford Algorithm Python Code Real-World Applications of Bellman-Ford Algorithm Frequently Asked Questions (Bellman-Ford Algorithm) What is the Bellman-Ford Algorithm used for? Can Bellman-Ford work with negative numbers? What is a negative weight cycle? Is Bellman-Ford better than Dijkstra? Where is Bellman-Ford used in real life? The Bellman-Ford Algorithm is a simple way to find the shortest path from one place (called the source node) to every other place in a network or graph. Imagine a graph as a bunch of points connected by lines. Each line has a number on it that could represent distance, time, or cost, how much it takes to travel from one point to another. Now here is what makes Bellman-Ford different from other algorithms. It can work even when some of those numbers are negative. That means if moving from one point to another actually reduces your total cost and Bellman-Ford can still handle it. Key Features of Bellman-Ford Algorithm Finds the shortest path from a single source to all other nodes. Works even if the graph has negative edge weights. Can detect negative weight cycles in the graph. Easier to understand and implement than some other algorithms. Slower than Dijkstra’s for large graphs but more flexible. How Does the Bellman-Ford Algorithm Work? The Bellman-Ford Algorithm works by finding the shortest way to reach every node from a starting node. First, it sets the distance to the starting node as 0 and to all other nodes as very large because we don not know their distances yet. Then it goes through all the connections (edges) in the graph again and again. Each time it checks if going through one node to reach another gives a shorter path. If it finds a shorter way then it will updates the distance. This process is repeated many times usually one less than the number of nodes in the graph. At the end the algorithm has the shortest distance to each node. It also checks if there is a cycle where the total distance keeps getting smaller, which would mean the graph has a negative weight cycle. Bellman-Ford vs Dijkstra Algorithm Feature Bellman-Ford Algorithm Dijkstra Handles Negative Weights Yes No Time Complexity O(V × E) O((V + E) log V) with heap Detects Negative Cycles Yes No Efficiency Slower Faster Bellman-Ford Algorithm Python Code def bellman_ford(graph, V, E, source): distance = [float("inf")] * V distance[source] = 0 for _ in range(V - 1): for u, v, w in graph: if distance[u] != float("inf") and distance[u] + w < distance[v]: distance[v] = distance[u] + w for u, v, w in graph: if distance[u] != float("inf") and distance[u] + w < distance[v]: print("Graph contains negative weight cycle") return None print("Vertex Distance from Source:") for i in range(V): print(f"{i} \t\t {distance[i]}") return distance V = 5 E = 8 graph = [ (0, 1, -1), (0, 2, 4), (1, 2, 3), (1, 3, 2), (1, 4, 2), (3, 2, 5), (3, 1, 1), (4, 3, -3) ] bellman_ford(graph, V, E, 0) Real-World Applications of Bellman-Ford Algorithm Used in network routing protocols like RIP (Routing Information Protocol). Helps detect negative weight cycles in financial fraud detection systems. Used in transportation systems to find the cheapest or fastest route. Useful in currency exchange to detect arbitrage opportunities. Applied in game development for AI pathfinding in weighted maps. Frequently Asked Questions (Bellman-Ford Algorithm) What is the Bellman-Ford Algorithm used for? It is used to find the shortest path from one point to all other points in a graph. Can Bellman-Ford work with negative numbers? Yes, it works even if some paths have negative weights. What is a negative weight cycle? It is a loop where the total path cost keeps getting smaller, forever. Is Bellman-Ford better than Dijkstra? Bellman-Ford is slower but works in more cases like with negative weights. Where is Bellman-Ford used in real life? It is used in maps, internet routing, currency exchange, and games.
Markdown	- [About Us](http://iquanta.in/) - [Success Stories](http://iquanta.in/) - [Privacy Policy and Terms](http://iquanta.in/) - [contact Us](http://iquanta.in/) [Flat 4000/- off on CAT 2026 Courses. Use Code JEET26](https://www.iquanta.in/ "Flat 4000/- off on CAT 2026 Courses. Use Code JEET26") [Join CAT Whatsapp Group](https://chat.whatsapp.com/JX9Yl1HSTsN7DcpWh5kDOK "Join CAT Whatsapp Group") [Free CAT Study Material\!](https://www.iquanta.in/free-cat-study-material "Free CAT Study Material!") [![Logo](https://www.iquanta.in/blog/wp-content/uploads/2023/05/iQuanta-White-Logo-1.png)](https://www.iquanta.in/blog/) [IIM Call Predictor](https://www.iquanta.in/iim-call-predictor "IIM Call Predictor") [Flat 4000/- off on CAT 2026 Courses. Use Code JEET26](https://www.iquanta.in/ "Flat 4000/- off on CAT 2026 Courses. Use Code JEET26") [Join CAT Whatsapp Group](https://chat.whatsapp.com/JX9Yl1HSTsN7DcpWh5kDOK "Join CAT Whatsapp Group") [Download CAT Syllabus & Strategy](https://media.iquanta.in/pdfs/CAT+Syllabus+2026-27+by+iQuanta.pdf "Download CAT Syllabus & Strategy") [Download VARC Cheat Sheet](https://media.iquanta.in/ui_images/VA-RC.pdf "Download VARC Cheat Sheet") [Download CAT Quant Formula PDF](https://media.iquanta.in/ui_images/iQuanta+Quant+Formulae+eBook+.pdf "Download CAT Quant Formula PDF") [Free CAT Study Material](https://www.iquanta.in/free-cat-study-material "Free CAT Study Material") [![Logo](https://www.iquanta.in/blog/wp-content/uploads/2023/05/iQuanta-White-Logo-1.png)](https://www.iquanta.in/) [IIM Call Predictor](https://www.iquanta.in/iim-call-predictor "IIM Call Predictor") - [Home](https://www.iquanta.in/) - [CAT & Non-CAT](https://www.iquanta.in/blog/category/cat-non-cat/) - [CAT Exam](https://www.iquanta.in/blog/category/cat-non-cat/cat-exam/) - [MBA Specialization](https://www.iquanta.in/blog/category/mba/mba-specialization/) - [MBA Preparation Tips](https://www.iquanta.in/blog/category/mba-exams/mba-preparation-tips/) - [Bschools Information](https://www.iquanta.in/blog/category/cat-non-cat/b-school/) - [Top B-Schools](https://www.iquanta.in/blog/category/cat-non-cat/b-school/top-b-schools/) - [Bschool placements](https://www.iquanta.in/blog/category/cat-non-cat/b-school/bschool-placements/) - [Bschool Interview Experiences](https://www.iquanta.in/blog/category/cat-non-cat/bschool-interview-experiences/) - [IIT-JEE & NEET](https://www.iquanta.in/blog/category/jee-neet/) - [IIT JEE](https://www.iquanta.in/blog/category/iit-jee/) - [NEET](https://www.iquanta.in/blog/category/neet/) - [CUET & After 12th](https://www.iquanta.in/blog/category/after-12th/) - [CUET Exam](https://www.iquanta.in/blog/category/after-12th/cuet-exam/) - [IPMAT](https://www.iquanta.in/blog/category/after-12th/ipmat/) - [CLAT](https://www.iquanta.in/blog/category/law/clat/) - [Study Abroad](https://www.iquanta.in/blog/category/gmat-study-abraod/) - [GMAT Exam](https://www.iquanta.in/blog/category/gmat-study-abraod/gmat-exam/) - [IELTS Exam](https://www.iquanta.in/blog/category/gmat-study-abraod/ielts-exam/) - [Others](https://www.iquanta.in/blog/category/others/) - [iQuanta’s Features](https://www.iquanta.in/blog/category/others/iquantas-features/) - [General Awareness](https://www.iquanta.in/blog/category/others/general-knowledge/) - [Motivation](https://www.iquanta.in/blog/category/others/motivation/) - [Bank Exam](https://www.iquanta.in/blog/category/others/bank-exam/) - [UPSC Exam](https://www.iquanta.in/blog/category/others/upsc-exam/) - [Design](https://www.iquanta.in/blog/category/design/) [Past Papers](https://www.iquanta.in/test/cat-previous-papers "Past Papers") [Home](https://www.iquanta.in/blog/) [iSkills](https://www.iquanta.in/blog/category/iskills/ "View all posts in iSkills") [DSA and Competitive Programming](https://www.iquanta.in/blog/category/iskills/dsa-competitive-programming/ "View all posts in DSA and Competitive Programming") Bellman-Ford Algorithm: Complete Guide with Python Code # Bellman-Ford Algorithm: Complete Guide with Python Code By [Nidhi Goswami](https://www.iquanta.in/blog/author/nidhigoswami/) \- May 26, 2025 [0](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#respond) 67 [Facebook](https://www.facebook.com/sharer.php?u=https%3A%2F%2Fwww.iquanta.in%2Fblog%2Fbellman-ford-algorithm-complete-guide-with-python-code%2F "Facebook") [Twitter](https://twitter.com/intent/tweet?text=Bellman-Ford+Algorithm%3A+Complete+Guide+with+Python+Code&url=https%3A%2F%2Fwww.iquanta.in%2Fblog%2Fbellman-ford-algorithm-complete-guide-with-python-code%2F&via=iQuanta "Twitter") [Pinterest](https://pinterest.com/pin/create/button/?url=https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/&media=https://www.iquanta.in/blog/wp-content/uploads/2025/05/Your-paragraph-text-22.png&description=The%20Bellman-Ford%20Algorithm%20is%20a%20fundamental%20concept%20in%20graph%20theory%20especially%20it%20is%20useful%20when%20dealing%20with%20graphs%20that%20have%20negative.... "Pinterest") [WhatsApp](https://api.whatsapp.com/send?text=Bellman-Ford+Algorithm%3A+Complete+Guide+with+Python+Code%20%0A%0A%20https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/ "WhatsApp") [![Bellman-Ford Algorithm](https://www.iquanta.in/blog/wp-content/uploads/2025/05/Your-paragraph-text-22-696x392.png)](https://www.iquanta.in/blog/wp-content/uploads/2025/05/Your-paragraph-text-22.png) Bellman-Ford Algorithm The Bellman-Ford Algorithm is a fundamental concept in graph theory especially it is useful when dealing with graphs that have negative weight edges. While many people are familiar with Dijkstra’s Algorithm for finding the shortest path that does not work correctly when negative weights are involved. That is where Bellman-Ford Algorithm comes in. It allows you to find the shortest paths from a single starting point to all other nodes in a graph even if some of the paths include negative edge weights. Although it is not the fastest algorithm out there but it has the ability to handle more complex graphs makes it valuable in real-world scenarios like network routing or financial analysis. In this article we will break down how the algorithm works and how to compare it to Dijkstra’s algorithm along with exploring its time complexity, walk through a Python implementation, and look at some practical use cases that all explained in a simple and easy manner. Table of Contents [Toggle](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/) - [What is Bellman-Ford Algorithm?](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#What_is_Bellman-Ford_Algorithm) - [Key Features of Bellman-Ford Algorithm](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#Key_Features_of_Bellman-Ford_Algorithm) - [How Does the Bellman-Ford Algorithm Work?](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#How_Does_the_Bellman-Ford_Algorithm_Work) - [Bellman-Ford vs Dijkstra Algorithm](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#Bellman-Ford_vs_Dijkstra_Algorithm) - [Bellman-Ford Algorithm Python Code](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#Bellman-Ford_Algorithm_Python_Code) - [Real-World Applications of Bellman-Ford Algorithm](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#Real-World_Applications_of_Bellman-Ford_Algorithm) - [Frequently Asked Questions (Bellman-Ford Algorithm)](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#Frequently_Asked_Questions_Bellman-Ford_Algorithm) - [What is the Bellman-Ford Algorithm used for?](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#What_is_the_Bellman-Ford_Algorithm_used_for) - [Can Bellman-Ford work with negative numbers?](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#Can_Bellman-Ford_work_with_negative_numbers) - [What is a negative weight cycle?](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#What_is_a_negative_weight_cycle) - [Is Bellman-Ford better than Dijkstra?](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#Is_Bellman-Ford_better_than_Dijkstra) - [Where is Bellman-Ford used in real life?](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#Where_is_Bellman-Ford_used_in_real_life) ## What is Bellman-Ford Algorithm? The Bellman-Ford Algorithm is a simple way to find the shortest path from one place (called the source node) to every other place in a network or graph. Imagine a [graph](https://www.iquanta.in/blog/graph-data-structure-its-types-and-representation/) as a bunch of points connected by lines. Each line has a number on it that could represent distance, time, or cost, how much it takes to travel from one point to another. Now here is what makes Bellman-Ford different from other algorithms. It can work even when some of those numbers are negative. That means if moving from one point to another actually reduces your total cost and Bellman-Ford can still handle it. ## Key Features of Bellman-Ford Algorithm 1. Finds the shortest path from a single source to all other nodes. 2. Works even if the graph has negative edge weights. 3. Can detect negative weight cycles in the graph. 4. Easier to understand and implement than some other algorithms. 5. Slower than Dijkstra’s for large graphs but more flexible. ## How Does the Bellman-Ford Algorithm Work? The Bellman-Ford Algorithm works by finding the shortest way to reach every node from a starting node. First, it sets the distance to the starting node as 0 and to all other nodes as very large because we don not know their distances yet. Then it goes through all the connections (edges) in the graph again and again. Each time it checks if going through one node to reach another gives a shorter path. If it finds a shorter way then it will updates the distance. This process is repeated many times usually one less than the number of nodes in the graph. At the end the algorithm has the shortest distance to each node. It also checks if there is a cycle where the total distance keeps getting smaller, which would mean the graph has a negative weight cycle. ## Bellman-Ford vs Dijkstra Algorithm \| \| \| \| \|---\|---\|---\| \| Feature \| Bellman-Ford Algorithm \| Dijkstra \| \| Handles Negative Weights \| Yes \| No \| \| Time Complexity \| O(V × E) \| O((V + E) log V) with heap \| \| Detects Negative Cycles \| Yes \| No \| \| Efficiency \| Slower \| Faster \| ## Bellman-Ford Algorithm Python Code ``` def bellman_ford(graph, V, E, source): distance = [float("inf")] * V distance[source] = 0 for _ in range(V - 1): for u, v, w in graph: if distance[u] != float("inf") and distance[u] + w < distance[v]: distance[v] = distance[u] + w for u, v, w in graph: if distance[u] != float("inf") and distance[u] + w < distance[v]: print("Graph contains negative weight cycle") return None print("Vertex Distance from Source:") for i in range(V): print(f"{i} \t\t {distance[i]}") return distance V = 5 E = 8 graph = [ (0, 1, -1), (0, 2, 4), (1, 2, 3), (1, 3, 2), (1, 4, 2), (3, 2, 5), (3, 1, 1), (4, 3, -3) ] bellman_ford(graph, V, E, 0) ``` ## Real-World Applications of Bellman-Ford Algorithm 1. Used in network routing protocols like RIP (Routing Information Protocol). 2. Helps detect negative weight cycles in financial fraud detection systems. 3. Used in transportation systems to find the cheapest or fastest route. 4. Useful in currency exchange to detect arbitrage opportunities. 5. Applied in game development for AI pathfinding in weighted maps. ## Frequently Asked Questions (Bellman-Ford Algorithm) ### What is the Bellman-Ford Algorithm used for? It is used to find the shortest path from one point to all other points in a graph. ### Can Bellman-Ford work with negative numbers? Yes, it works even if some paths have negative weights. ### What is a negative weight cycle? It is a loop where the total path cost keeps getting smaller, forever. ### Is Bellman-Ford better than Dijkstra? Bellman-Ford is slower but works in more cases like with negative weights. ### Where is Bellman-Ford used in real life? It is used in maps, internet routing, currency exchange, and games. [Facebook](https://www.facebook.com/sharer.php?u=https%3A%2F%2Fwww.iquanta.in%2Fblog%2Fbellman-ford-algorithm-complete-guide-with-python-code%2F "Facebook") [Twitter](https://twitter.com/intent/tweet?text=Bellman-Ford+Algorithm%3A+Complete+Guide+with+Python+Code&url=https%3A%2F%2Fwww.iquanta.in%2Fblog%2Fbellman-ford-algorithm-complete-guide-with-python-code%2F&via=iQuanta "Twitter") [Pinterest](https://pinterest.com/pin/create/button/?url=https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/&media=https://www.iquanta.in/blog/wp-content/uploads/2025/05/Your-paragraph-text-22.png&description=The%20Bellman-Ford%20Algorithm%20is%20a%20fundamental%20concept%20in%20graph%20theory%20especially%20it%20is%20useful%20when%20dealing%20with%20graphs%20that%20have%20negative.... "Pinterest") [WhatsApp](https://api.whatsapp.com/send?text=Bellman-Ford+Algorithm%3A+Complete+Guide+with+Python+Code%20%0A%0A%20https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/ "WhatsApp") Previous article[IIT Mandi Cutoff 2025 – Know the Expected Cutoff for all BTech Programs](https://www.iquanta.in/blog/iit-mandi-cutoff-2025/) Next article[Top 7 Application of Graph in Data Structure with Examples](https://www.iquanta.in/blog/top-7-application-of-graph-in-data-structure-with-examples/) [![Nidhi Goswami](https://secure.gravatar.com/avatar/21d234d87afd924b217d26b25a3cf1ee?s=96&d=mm&r=g)](https://www.iquanta.in/blog/author/nidhigoswami/) [Nidhi Goswami](https://www.iquanta.in/blog/author/nidhigoswami/) #### [RELATED ARTICLES](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/)[MORE FROM AUTHOR](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/) [![](data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAANoAAACWAQMAAACCSQSPAAAAA1BMVEWurq51dlI4AAAAAXRSTlMmkutdmwAAABpJREFUWMPtwQENAAAAwiD7p7bHBwwAAAAg7RD+AAGXD7BoAAAAAElFTkSuQmCC)](https://www.iquanta.in/blog/top-10-applications-of-linked-list-data-structure-2025/ "Top 10 Applications of Linked List Data Structure [2025]") ### [Top 10 Applications of Linked List Data Structure \[2025\]](https://www.iquanta.in/blog/top-10-applications-of-linked-list-data-structure-2025/ "Top 10 Applications of Linked List Data Structure [2025]") [![QuickSort Algorithm](data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAANoAAACWAQMAAACCSQSPAAAAA1BMVEWurq51dlI4AAAAAXRSTlMmkutdmwAAABpJREFUWMPtwQENAAAAwiD7p7bHBwwAAAAg7RD+AAGXD7BoAAAAAElFTkSuQmCC)](https://www.iquanta.in/blog/quicksort-algorithm-working-time-complexity-advantages/ "QuickSort Algorithm: Working, Time Complexity & Advantages") ### [QuickSort Algorithm: Working, Time Complexity & Advantages](https://www.iquanta.in/blog/quicksort-algorithm-working-time-complexity-advantages/ "QuickSort Algorithm: Working, Time Complexity & Advantages") [![](data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAANoAAACWAQMAAACCSQSPAAAAA1BMVEWurq51dlI4AAAAAXRSTlMmkutdmwAAABpJREFUWMPtwQENAAAAwiD7p7bHBwwAAAAg7RD+AAGXD7BoAAAAAElFTkSuQmCC)](https://www.iquanta.in/blog/data-preprocessing-in-machine-learning-steps-advantages/ "Data Preprocessing in Machine Learning: Steps & Advantages") ### [Data Preprocessing in Machine Learning: Steps & Advantages](https://www.iquanta.in/blog/data-preprocessing-in-machine-learning-steps-advantages/ "Data Preprocessing in Machine Learning: Steps & Advantages") #### Recent Posts - [IIM Rohtak IPM vs IIM Ranchi IPM: Key Differences, Fee Structure and Admission Process](https://www.iquanta.in/blog/iim-rohtak-ipm-vs-iim-ranchi-ipm/) - [IPM Colleges Selection Weightage](https://www.iquanta.in/blog/ipm-colleges-selection-weightage/) - [FMS Delhi Final Placements 2026 Out: Average Package INR 32.27 LPA, Highest CTC INR 1.1 Cr](https://www.iquanta.in/blog/fms-delhi-final-placements-2026-out/) - [Minimum Percentage Required for CAT Exam – Can You Apply with Low Marks?](https://www.iquanta.in/blog/minimum-percentage-required-for-cat-exam/) - [Top 50 MBA Colleges Average Age of the Batch](https://www.iquanta.in/blog/top-50-mba-colleges-average-age-of-the-batch/) [![Logo](https://www.iquanta.in/blog/wp-content/uploads/2023/05/iQuanta-White-Logo-1.png)](https://www.iquanta.in/blog/) © Indrajeet's iQuanta Edu Services Pvt Ltd. [Facebook](https://www.facebook.com/iQuanta.in "Facebook") [Instagram](https://www.instagram.com/iQuanta.in "Instagram") [Youtube](https://www.youtube.com/channel/UCJcXnTkWeIrXavsa_DUzq5w "Youtube") #### Our Courses - [CAT 2026 Course](https://www.iquanta.in/cat-2026) - [CAT 2027 Course](https://www.iquanta.in/cat-2027) - [IPMAT Online Course](https://www.iquanta.in/ipmat) - [CLAT 2026 Course](https://www.iquanta.in/clat-coaching) - [JEE 2026 Course](https://www.iquanta.in/iit-jee-coaching) - [NEET 2026 Course](https://www.iquanta.in/neet-coaching) #### After 12th - [IPMAT](https://www.iquanta.in/blog/category/after-12th/ipmat/) - [IPMAT Mini Mock Series](https://www.iquanta.in/blog/category/after-12th/ipmat/ipmat-mini-mock-series/) - [IPMAT VARC](https://www.iquanta.in/blog/category/after-12th/ipmat/ipmat-varc/) - [IPMAT LR](https://www.iquanta.in/blog/category/after-12th/ipmat/ipmat-lr/) - [CUET & After 12th](https://www.iquanta.in/blog/category/after-12th/) - [Law](https://www.iquanta.in/blog/category/law/) - [CLAT](https://www.iquanta.in/blog/category/law/clat/) - [CLAT Mini Mock Series](https://www.iquanta.in/blog/category/law/clat/clat-mini-mock-series/) - [CLAT DNA](https://www.iquanta.in/blog/category/law/clat/clat-dna/) - [CLAT GK](https://www.iquanta.in/blog/category/law/clat/clat-gk/) - [clat](https://www.iquanta.in/blog/category/clat-2/) - [IIT-JEE & NEET](https://www.iquanta.in/blog/category/jee-neet/) - [NEET](https://www.iquanta.in/blog/category/neet/) - [IIT JEE](https://www.iquanta.in/blog/category/iit-jee/) #### Popular Category - [CAT Exam1151](https://www.iquanta.in/blog/category/cat-non-cat/cat-exam/) - [CAT & Non-CAT1055](https://www.iquanta.in/blog/category/cat-non-cat/) - [IIT-JEE & NEET393](https://www.iquanta.in/blog/category/jee-neet/) - [IIT JEE357](https://www.iquanta.in/blog/category/iit-jee/) - [CLAT352](https://www.iquanta.in/blog/category/law/clat/) - [Law308](https://www.iquanta.in/blog/category/law/) #### Editor Picks ### [IIM Rohtak IPM vs IIM Ranchi IPM: Key Differences, Fee Structure and Admission Process](https://www.iquanta.in/blog/iim-rohtak-ipm-vs-iim-ranchi-ipm/ "IIM Rohtak IPM vs IIM Ranchi IPM: Key Differences, Fee Structure and Admission Process") April 8, 2026 [Home](https://www.iquanta.in/blog) Past Papers [Result](https://www.iquanta.in/results) Search × - [IPMAT](https://www.iquanta.in/blog/category/after-12th/ipmat/) - [IPMAT Mini Mock Series](https://www.iquanta.in/blog/category/after-12th/ipmat/ipmat-mini-mock-series/) - [IPMAT VARC](https://www.iquanta.in/blog/category/after-12th/ipmat/ipmat-varc/) - [IPMAT LR](https://www.iquanta.in/blog/category/after-12th/ipmat/ipmat-lr/) - [CUET & After 12th](https://www.iquanta.in/blog/category/after-12th/) - [Law](https://www.iquanta.in/blog/category/law/) - [CLAT](https://www.iquanta.in/blog/category/law/clat/) - [CLAT Mini Mock Series](https://www.iquanta.in/blog/category/law/clat/clat-mini-mock-series/) - [CLAT DNA](https://www.iquanta.in/blog/category/law/clat/clat-dna/) - [CLAT GK](https://www.iquanta.in/blog/category/law/clat/clat-gk/) - [clat](https://www.iquanta.in/blog/category/clat-2/) - [IIT-JEE & NEET](https://www.iquanta.in/blog/category/jee-neet/) - [NEET](https://www.iquanta.in/blog/category/neet/) - [IIT JEE](https://www.iquanta.in/blog/category/iit-jee/) - Free Counselling Get Free 1 on 1 Counselling - [Phone](tel:+917683043155 "+917683043155")
Readable Markdown	[![Bellman-Ford Algorithm](https://www.iquanta.in/blog/wp-content/uploads/2025/05/Your-paragraph-text-22-696x392.png)](https://www.iquanta.in/blog/wp-content/uploads/2025/05/Your-paragraph-text-22.png) Bellman-Ford Algorithm The Bellman-Ford Algorithm is a fundamental concept in graph theory especially it is useful when dealing with graphs that have negative weight edges. While many people are familiar with Dijkstra’s Algorithm for finding the shortest path that does not work correctly when negative weights are involved. That is where Bellman-Ford Algorithm comes in. It allows you to find the shortest paths from a single starting point to all other nodes in a graph even if some of the paths include negative edge weights. Although it is not the fastest algorithm out there but it has the ability to handle more complex graphs makes it valuable in real-world scenarios like network routing or financial analysis. In this article we will break down how the algorithm works and how to compare it to Dijkstra’s algorithm along with exploring its time complexity, walk through a Python implementation, and look at some practical use cases that all explained in a simple and easy manner. Table of Contents - [What is Bellman-Ford Algorithm?](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#What_is_Bellman-Ford_Algorithm) - [Key Features of Bellman-Ford Algorithm](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#Key_Features_of_Bellman-Ford_Algorithm) - [How Does the Bellman-Ford Algorithm Work?](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#How_Does_the_Bellman-Ford_Algorithm_Work) - [Bellman-Ford vs Dijkstra Algorithm](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#Bellman-Ford_vs_Dijkstra_Algorithm) - [Bellman-Ford Algorithm Python Code](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#Bellman-Ford_Algorithm_Python_Code) - [Real-World Applications of Bellman-Ford Algorithm](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#Real-World_Applications_of_Bellman-Ford_Algorithm) - [Frequently Asked Questions (Bellman-Ford Algorithm)](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#Frequently_Asked_Questions_Bellman-Ford_Algorithm) - [What is the Bellman-Ford Algorithm used for?](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#What_is_the_Bellman-Ford_Algorithm_used_for) - [Can Bellman-Ford work with negative numbers?](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#Can_Bellman-Ford_work_with_negative_numbers) - [What is a negative weight cycle?](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#What_is_a_negative_weight_cycle) - [Is Bellman-Ford better than Dijkstra?](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#Is_Bellman-Ford_better_than_Dijkstra) - [Where is Bellman-Ford used in real life?](https://www.iquanta.in/blog/bellman-ford-algorithm-complete-guide-with-python-code/#Where_is_Bellman-Ford_used_in_real_life) The Bellman-Ford Algorithm is a simple way to find the shortest path from one place (called the source node) to every other place in a network or graph. Imagine a [graph](https://www.iquanta.in/blog/graph-data-structure-its-types-and-representation/) as a bunch of points connected by lines. Each line has a number on it that could represent distance, time, or cost, how much it takes to travel from one point to another. Now here is what makes Bellman-Ford different from other algorithms. It can work even when some of those numbers are negative. That means if moving from one point to another actually reduces your total cost and Bellman-Ford can still handle it. ## Key Features of Bellman-Ford Algorithm 1. Finds the shortest path from a single source to all other nodes. 2. Works even if the graph has negative edge weights. 3. Can detect negative weight cycles in the graph. 4. Easier to understand and implement than some other algorithms. 5. Slower than Dijkstra’s for large graphs but more flexible. ## How Does the Bellman-Ford Algorithm Work? The Bellman-Ford Algorithm works by finding the shortest way to reach every node from a starting node. First, it sets the distance to the starting node as 0 and to all other nodes as very large because we don not know their distances yet. Then it goes through all the connections (edges) in the graph again and again. Each time it checks if going through one node to reach another gives a shorter path. If it finds a shorter way then it will updates the distance. This process is repeated many times usually one less than the number of nodes in the graph. At the end the algorithm has the shortest distance to each node. It also checks if there is a cycle where the total distance keeps getting smaller, which would mean the graph has a negative weight cycle. ## Bellman-Ford vs Dijkstra Algorithm \| \| \| \| \|---\|---\|---\| \| Feature \| Bellman-Ford Algorithm \| Dijkstra \| \| Handles Negative Weights \| Yes \| No \| \| Time Complexity \| O(V × E) \| O((V + E) log V) with heap \| \| Detects Negative Cycles \| Yes \| No \| \| Efficiency \| Slower \| Faster \| ## Bellman-Ford Algorithm Python Code ``` def bellman_ford(graph, V, E, source): distance = [float("inf")] * V distance[source] = 0 for _ in range(V - 1): for u, v, w in graph: if distance[u] != float("inf") and distance[u] + w < distance[v]: distance[v] = distance[u] + w for u, v, w in graph: if distance[u] != float("inf") and distance[u] + w < distance[v]: print("Graph contains negative weight cycle") return None print("Vertex Distance from Source:") for i in range(V): print(f"{i} \t\t {distance[i]}") return distance V = 5 E = 8 graph = [ (0, 1, -1), (0, 2, 4), (1, 2, 3), (1, 3, 2), (1, 4, 2), (3, 2, 5), (3, 1, 1), (4, 3, -3) ] bellman_ford(graph, V, E, 0) ``` ## Real-World Applications of Bellman-Ford Algorithm 1. Used in network routing protocols like RIP (Routing Information Protocol). 2. Helps detect negative weight cycles in financial fraud detection systems. 3. Used in transportation systems to find the cheapest or fastest route. 4. Useful in currency exchange to detect arbitrage opportunities. 5. Applied in game development for AI pathfinding in weighted maps. ## Frequently Asked Questions (Bellman-Ford Algorithm) ### What is the Bellman-Ford Algorithm used for? It is used to find the shortest path from one point to all other points in a graph. ### Can Bellman-Ford work with negative numbers? Yes, it works even if some paths have negative weights. ### What is a negative weight cycle? It is a loop where the total path cost keeps getting smaller, forever. ### Is Bellman-Ford better than Dijkstra? Bellman-Ford is slower but works in more cases like with negative weights. ### Where is Bellman-Ford used in real life? It is used in maps, internet routing, currency exchange, and games.
Shard	111 (laksa)
Root Hash	15211331546999444711
Unparsed URL	in,iquanta!www,/blog/bellman-ford-algorithm-complete-guide-with-python-code/ s443