Jisho

×
最短経路問題
Links
Wikipedia definition
1. Shortest path problem​In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. An example is finding the quickest way to get from one location to another on a road map; in this case, the vertices represent locations and the edges represent segments of road and are weighted by the time needed to travel that segment.
Read “Shortest path problem” on English Wikipedia
Read “最短経路問題” on Japanese Wikipedia
Read “Shortest path problem” on DBpedia

Discussions

to talk about this word.