@prefix p: <http://www.wikidata.org/prop/> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix schema1: <http://schema.org/> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix wd: <http://www.wikidata.org/entity/> .
@prefix wds: <http://www.wikidata.org/entity/statement/> .
@prefix wdt: <http://www.wikidata.org/prop/direct/> .
@prefix wdtn: <http://www.wikidata.org/prop/direct-normalized/> .
@prefix wikibase: <http://wikiba.se/ontology#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

wd:Q1058754 rdfs:label "مسألة المسار الأقصر"@ar,
        "problema del camí més curt"@ca,
        "Kürzester Pfad"@de,
        "shortest path problem"@en,
        "problemo de plej mallonga vojo"@eo,
        "problema del camino más corto"@es,
        "مسئله یافتن کوتاهترین مسیر"@fa,
        "lyhimmän polun ongelma"@fi,
        "problèmes de cheminement"@fr,
        "legrövidebb út probléma"@hu,
        "Jarak terpendek"@id,
        "problema del cammino minimo"@it,
        "最短経路問題"@ja,
        "최단 경로 문제"@ko,
        "Trumpiausio kelio problema"@lt,
        "Jarak terpendek"@ms,
        "shortest path problem"@nl,
        "kortaste veg-problemet"@nn,
        "problem najkrótszej ścieżki"@pl,
        "problema do caminho mínimo"@pt,
        "problema celui mai scurt drum"@ro,
        "задача о кратчайшем пути"@ru,
        "problem najkrajše poti"@sl,
        "Проблем најкраћег пута"@sr,
        "ปัญหาวิถีสั้นสุด"@th,
        "En kısa yol problemi"@tr,
        "задача про найкоротший шлях"@uk,
        "کمترین رستہ الخوارزم"@ur,
        "Bài toán đường đi ngắn nhất"@vi,
        "最短路问题"@zh,
        "最短路问题"@zh-hans,
        "最短路問題"@zh-hant,
        "最短路問題"@zh-hk ;
    schema1:dateModified "2026-04-20T08:49:16+00:00"^^xsd:dateTime ;
    schema1:description "Begriff aus der Graphentheorie in der Mathematik"@de,
        "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"@en,
        "problema que consiste en encontrar un camino entre dos vértices o nodos, de tal manera que la suma de los pesos de las aristas que lo constituyen sea mínima"@es,
        "مسئلهای در نظریهٔ گراف"@fa,
        "laskennallinen ongelma"@fi,
        "problèmes classiques mathématiques de la théorie des graphes"@fr,
        "masalah komputasional"@id,
        "nella teoria dei grafi è il cammino minimo tra due vertici e che minimizza la somma dei costi associati all'attraversamento di ciascun lato"@it,
        "задача поиска кратчайшего пути во взвешенном графе между двумя вершинами"@ru,
        "ปัญหาที่ต้องการหาวิถีสั้นสุดระหว่างจุดยอดภายในกราฟ"@th ;
    schema1:version 2483359726 ;
    wikibase:identifiers 9 ;
    wikibase:sitelinks 24 ;
    wikibase:statements 12 ;
    skos:altLabel "مسألة أقصر طريق"@ar,
        "Problema dels camins més curts"@ca,
        "APSP"@de,
        "Kürzeste-Pfad-Problem"@de,
        "Kürzester Weg"@de,
        "Kürzester-Weg-Problem"@de,
        "SSSP"@de,
        "Shortest Path"@de,
        "Shortest-Path"@de,
        "single-pair shortest path problem"@en,
        "problema de los caminos mas cortos"@es,
        "problema de los caminos más cortos"@es,
        "problema del camino mas corto"@es,
        "مسألۀ یافتن کوتاهترین مسیر"@fa,
        "مسئله یافتن کوتاه ترین مسیر"@fa,
        "مسئلهٔ یافتن کوتاهترین مسیر"@fa,
        "مساله یافتن کوتاهترین مسیر"@fa,
        "plus court chemin"@fr,
        "problemes de cheminement"@fr,
        "problème du plus court chemin"@fr,
        "cammini minimi"@it,
        "cammino minimo"@it,
        "shortest path"@it,
        "kortaste veg"@nn,
        "najkrótsza ścieżka"@pl,
        "odnajdywanie najkrótszej ścieżki"@pl,
        "odnalezienie najkrótszej ścieżki"@pl,
        "znajdowanie optymalnej drogi"@pl,
        "problema do caminho mais curto"@pt,
        "Dolžine najkrajših poti"@sl,
        "iskanje najkrajše poti"@sl,
        "najkrajša pot"@sl,
        "ปัญหาวิถีสั้นสุดแบบแหล่งต้นทางเดียว"@th,
        "วิถีสั้นสุด"@th,
        "Shortest path algorithm"@ur,
        "Bài toán tìm đường đi ngắn nhất"@vi,
        "Bài toán đường đi ngắn nhất giữa mọi cặp đỉnh"@vi,
        "Bài toán đường đi ngắn nhất nguồn đơn"@vi,
        "Tìm đường đi ngắn nhất"@vi,
        "Đường đi ngắn nhất"@vi,
        "单源最短路"@zh,
        "图论最短路"@zh,
        "最短路径"@zh,
        "最短路径问题"@zh ;
    p:P10283 wds:Q1058754-CDFEC239-B86D-4773-8CED-5DEADAB9BBBA ;
    p:P13591 wds:Q1058754-8EA9A283-C339-44FE-8FCD-0231D126B950 ;
    p:P1417 wds:Q1058754-ECFDCCA0-A686-408B-B1EE-B7C21ABCBF8D ;
    p:P18 wds:Q1058754-716c787b-4974-afcd-b34f-ab3522ef42a9 ;
    p:P227 wds:q1058754-b1eff0fa-45f9-bd9d-7df8-08dc706b94ec ;
    p:P2812 wds:Q1058754-B19209EB-9773-4579-80FF-FCA3D229E383 ;
    p:P31 wds:Q1058754-18fc6a7c-4cc4-2095-0a03-5d024a6fb24e ;
    p:P5106 wds:Q1058754-5CE46733-0260-431A-84D8-B7033E87FFD6,
        wds:Q1058754-5FC32BAF-A21B-4EBB-A144-B39B111E7058 ;
    p:P6104 wds:Q1058754-BEAB734E-3530-41CD-9713-2D7C85C07CF1 ;
    p:P6366 wds:Q1058754-6E489126-1B9B-48EE-99E1-7B7C1522E200 ;
    p:P646 wds:Q1058754-41B02990-3A49-4CA1-9730-1028B038ED1D ;
    wdtn:P227 <https://d-nb.info/gnd/4138403-9> ;
    wdtn:P6366 <https://makg.org/entity/22590252> ;
    wdt:P10283 "C22590252" ;
    wdt:P13591 "concept/20f81b3b-453f-47f4-87ba-7b252da0431f" ;
    wdt:P1417 "topic/shortest-path-problem" ;
    wdt:P18 <http://commons.wikimedia.org/wiki/Special:FilePath/Shortest%20path%20with%20direct%20weights.svg> ;
    wdt:P227 "4138403-9" ;
    wdt:P2812 "ShortestPathProblem" ;
    wdt:P31 wd:Q3435924 ;
    wdt:P5106 "shortestpath",
        "singlepairShortestpathProblem" ;
    wdt:P6104 wd:Q8487137 ;
    wdt:P6366 "22590252" ;
    wdt:P646 "/m/0bjw6" .