알고리즘 읽기 노트

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; }