Graph optimisation

語彙

English	意味
cuts	Partitions of a graph's vertex set into two groups.
Kruskal	A minimum-spanning-tree algorithm adding edges in increasing weight order while avoiding cycles.

English

Light edges across cuts

A cut partitions the vertices; the lightest edge crossing it is safe to accept — the property behind Kruskal (sort, accept, reject cycles) and Dijkstra's settle step.

{exercise:uni-cs1005-cut}

実践

The light edge crossing a cut is —

難易度 1/5 · 100 コイン + 今日初回達成時の小ボーナス

English

Sorted: C–B 1, A–C 2, D–E 2, E–F 3, A–B 4, B–D 5, D–F 6, C–D 8, C–E 10. Accept C–B, A–C, D–E, E–F, B–D; reject the rest (cycles).
The MST weight is $1+2+2+3+5 = 13$, suite-verified. The proof: any tree plus a light crossing edge, minus the cycle's other crossing edge, keeps or lowers the weight.

{exercise:uni-cs1005-kruskal}

実践

Kruskal on the course graph yields MST weight —

難易度 1/5 · 100 コイン + 今日初回達成時の小ボーナス

English

Dijkstra settles a node and never reconsiders: on A→B (5), A→C (1), C→B (1), settling B at 5 misses the path of 2.
The light-edge guarantee needs non-negative weights; with negatives, Bellman-Ford's $\Theta(VE)$ relaxation rounds are the honest tool — and they detect negative cycles.

{exercise:uni-cs1005-negative}

実践

With edges A-B 5, A-C 1, C-B 1, settling-nearest Dijkstra fixes B at —

難易度 1/5 · 100 コイン + 今日初回達成時の小ボーナス