ملاحظة قراءة الخوارزمية

Bellman–Ford Algorithm

Bellman–Ford computes single-source shortest paths even with negative edge weights, and can detect a reachable negative-weight cycle.

النوعخوارزميةالفئةGraphsالعمقمتقدمالتعقيد المعتادO(VE)

إجابة مقابلة قصيرة

ابدأ بهذا النموذج الذهني

Bellman–Ford computes single-source shortest paths even with negative edge weights, and can detect a reachable negative-weight cycle.

شرح مبسط

كيف يعمل، بلا مصطلحات زائدة

Relax every edge V−1 times because a simple shortest path uses at most V−1 edges.

A further successful relaxation indicates a reachable negative cycle.

التنفيذ

اقرأ الخوارزمية كسلسلة من القرارات

Define directed/undirected and weighted/unweighted assumptions.

Choose the graph representation.

Track algorithm state and handle disconnected/cyclic cases explicitly.

مثال صغير لتحتفظ به في ذهنك

Read a tiny input by hand and write down the state after every important operation. For Bellman–Ford Algorithm, the goal is to make the invariant visible rather than to memorize code.

تطبيق JavaScript قابل للقراءةJavaScript

function bellmanFord(vertices, edges, start) {
  const dist = Array(vertices).fill(Infinity);
  dist[start] = 0;
  for (let i = 1; i < vertices; i++) {
    for (const [u, v, w] of edges) {
      if (dist[u] !== Infinity && dist[u] + w < dist[v]) {
        dist[v] = dist[u] + w;
      }
    }
  }
  return dist;
}

كيف تقرأ هذا الكود

لا تحفظ الصياغة. تتبع الحالة التي تتغير في كل سطر واربطها بالثابت الموضح أعلاه.

التعقيد

O(VE)

Do not quote this complexity mechanically. Ask which operation or input dimension it describes, then derive the cost from the loops, recursion depth, data-structure operations and any preprocessing assumptions.

متى تستخدمه

مناسب لـ

Use the algorithm only when its graph assumptions match the problem.

أخطاء شائعة

ما الذي يسوء عادةً

Forgetting disconnected components.
Mixing weighted and unweighted shortest-path algorithms.
Not protecting against revisits/cycles.

كيف تشرحه في المقابلة

صيغة إجابة احترافية

Compare it with Dijkstra: Bellman–Ford is slower O(VE) but supports negative weights and negative-cycle detection.

المشكلة→الفكرة الأساسية→الثابت / الحالة→Big-O→المفاضلة

فحص سريع للمقابلة

What problem does Bellman–Ford Algorithm solve?

Bellman–Ford computes single-source shortest paths even with negative edge weights, and can detect a reachable negative-weight cycle.

ماذا يجب أن أذكر عن التعقيد؟

Its typical cost here is O(VE), but a complete answer should connect that cost to the representation, input constraints and the dominant operations.

ما الخطأ الأكثر شيوعاً؟

Forgetting disconnected components.

متابعة القراءةGraph representationDFS/BFSPriority queues

function bellmanFord(vertices, edges, start) { const dist = Array(vertices).fill(Infinity); dist[start] = 0; for (let i = 1; i < vertices; i++) { for (const [u, v, w] of edges) { if (dist[u] !== Infinity && dist[u] + w < dist[v]) { dist[v] = dist[u] + w; } } } return dist; }