Last Updated：2025/11/26

(graph theory) An algorithm that computes single-source shortest paths in a weighted digraph.

音声機能が動作しない場合はこちらをご確認ください

See correct answer

Dijkstra's algorithm

Source Word

Dijkstra's algorithm

IPA(Pronunciation)

(graph theory) An algorithm that computes single-source shortest paths in a weighted digraph.

Japanese Meaning

重み付き有向グラフにおける単一始点最短経路を計算するアルゴリズム

For the assignment, I implemented Dijkstra's algorithm to find single-source shortest paths in a weighted digraph.

課題のために、ダイクストラが考案した有向重み付きグラフにおける単一始点最短経路を求めるアルゴリズムを実装しました。

Sense（1）

(graph theory) An algorithm that computes single-source shortest paths in a weighted digraph.