Back مسألة المسار الأقصر Arabic Problema del camí més curt Catalan Kürzester Pfad German Problema del camino más corto Spanish مسئله یافتن کوتاهترین مسیر Persian Problème de plus court chemin French Masalah lintasan terpendek ID Cammino minimo Italian 最短経路問題 Japanese 최단 경로 문제 Korean
 | This article includes a list of general references, but it lacks sufficient corresponding inline citations. (June 2009) |
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.[1]
The problem of finding the shortest path between two intersections on a road map may be modeled as a special case of the shortest path problem in graphs, where the vertices correspond to intersections and the edges correspond to road segments, each weighted by the length or distance of each segment.
- ^ The Shortest-Path Problem. Synthesis Lectures on Theoretical Computer Science. 2015. doi:10.1007/978-3-031-02574-7. ISBN 978-3-031-01446-8.
© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search