ダイクストラ法
1. Dijkstra's algorithmDijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959, is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms. For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e.
Read “Dijkstra's algorithm” on English Wikipedia
Read “ダイクストラ法” on Japanese Wikipedia
Read “Dijkstra's algorithm” on DBpedia
Read “Dijkstra's algorithm” on English Wikipedia
Read “ダイクストラ法” on Japanese Wikipedia
Read “Dijkstra's algorithm” on DBpedia
Discussions
Log in to talk about this word.