@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:Q470813 rdfs:label "خوارزمية بريم"@ar,
        "Algorisme de Prim"@ca,
        "Jarníkův algoritmus"@cs,
        "Algorithmus von Prim"@de,
        "Prim's algorithm"@en,
        "Prim-algoritmo"@eo,
        "Algoritmo de Prim"@es,
        "الگوریتم پریم"@fa,
        "Primin algoritmi"@fi,
        "algorithme de Prim"@fr,
        "האלגוריתם של פרים"@he,
        "प्रिम एल्गोरिदम"@hi,
        "Prim-algoritmus"@hu,
        "Algoritma Prim"@id,
        "Algoritmo di Prim"@it,
        "プリム法"@ja,
        "პრიმის ალგორითმი"@ka,
        "프림 알고리즘"@ko,
        "Примов алгоритам"@mk,
        "Prim ián-sǹg-hoat"@nan,
        "Prims algoritme"@nb,
        "Algoritme van Prim"@nl,
        "Algorytm Prima"@pl,
        "Algoritmo de Prim"@pt,
        "Algoritmul lui Prim"@ro,
        "Алгоритм Прима"@ru,
        "Primov algoritmus"@sk,
        "Primov algoritem"@sl,
        "Примов алгоритам"@sr,
        "Примов алгоритам"@sr-ec,
        "Primov algoritam"@sr-el,
        "Prims algoritm"@sv,
        "ขั้นตอนวิธีของพริม"@th,
        "Prim algoritması"@tr,
        "Алгоритм Прима"@uk,
        "Thuật toán Prim"@vi,
        "普林演算法"@zh,
        "普里姆算法"@zh-cn,
        "普里姆算法"@zh-hans,
        "普林演算法"@zh-hant,
        "普林演算法"@zh-hk,
        "普里姆算法"@zh-sg,
        "普林演算法"@zh-tw ;
    schema1:dateModified "2026-11-14T01:42:37+00:00"^^xsd:dateTime ;
    schema1:description "Handlungsvorschriften zur Lösung eines Problems in der Informatik"@de,
        "algorithm for finding the minimum spanning tree for weighted undirected graphs"@en,
        "algoritme glouton qui calcule un arbre couvrant minimal"@fr,
        "भारित अनिर्देशित ग्राफ़ों में न्यूनतम स्पैनिंग ट्री खोजने का एल्गोरिदम"@hi,
        "matematikai eljárás"@hu,
        "algoritmo sui grafi"@it,
        "алгоритам"@mk ;
    schema1:version 2568971530 ;
    wikibase:identifiers 6 ;
    wikibase:sitelinks 33 ;
    wikibase:statements 20 ;
    skos:altLabel "algorisme de Jarník"@ca,
        "algorisme de Prim-Jarník"@ca,
        "DJP algoritmus"@cs,
        "Primův algoritmus"@cs,
        "Algorithmus von Jarnik, Prim und Dijkstra"@de,
        "Prim-Dijkstra-Algorithmus"@de,
        "Primscher Algorithmus"@de,
        "DJP algorithm"@en,
        "Jarnik algorithm"@en,
        "Jarník algorithm"@en,
        "Prim–Dijkstra algorithm"@en,
        "Prim–Jarník algorithm"@en,
        "Jarník-algoritmo"@eo,
        "Algoritmo DJP"@es,
        "Algoritmo de Jarnik"@es,
        "אלגוריתם פרים"@he,
        "プリムのアルゴリズム"@ja,
        "프림의 알고리즘"@ko,
        "Prims algoritme"@nl,
        "Algorytm Dijkstry Prima"@pl,
        "Algorytm Dijkstry-Prima"@pl,
        "Algorytm Jarnika"@pl,
        "Algoritem DJP"@sl,
        "Jarníkov algoritem"@sl,
        "Prim-Jarníkov algoritem"@sl,
        "Јарников алгоритам"@sr,
        "ДЈП алгоритам"@sr,
        "Prim"@zh,
        "Prim演算法"@zh,
        "普里姆算法"@zh ;
    p:P10283 wds:Q470813-980218ED-7451-409E-ADC6-46D5C89A8375 ;
    p:P138 wds:Q470813-63fee8e4-4a66-1fa9-0d69-ef129deae42f,
        wds:q470813-0c7e4be9-4dac-102e-747f-77521e651765 ;
    p:P31 wds:Q470813-45B60198-F8F9-4F13-8839-196F2C087778,
        wds:Q470813-685038ab-45de-40b7-d862-2c2dab29782c,
        wds:Q470813-c9d3019c-4186-6b95-1d41-3aa09ec8b220 ;
    p:P366 wds:Q470813-0c5beb7b-46da-723f-07d8-b83e43c65af8,
        wds:Q470813-8af4a754-4453-0aca-becc-44424f94c1e4 ;
    p:P373 wds:q470813-B5E58FBD-9BAA-4D28-B2A9-9529657455AB ;
    p:P3752 wds:Q470813-04399989-4d16-06cd-85d8-e6039344e08f,
        wds:Q470813-8851bb87-45f5-5788-b417-45d0050f01b6,
        wds:Q470813-b18f563d-4bdb-0e21-4fd2-7487694c4910 ;
    p:P5106 wds:Q470813-2EE83E28-0A0E-419C-AB23-A0EFB45740AC,
        wds:Q470813-74DCE8B0-7580-4F27-94FB-D5AA008F265D,
        wds:Q470813-82829049-E738-4BC1-9F3C-6BB5D4C2B77F ;
    p:P61 wds:Q470813-049a3d57-4f16-fa44-708e-299fd397943c,
        wds:Q470813-8964ad76-416c-bf67-e210-61bb07835529,
        wds:Q470813-bef42e6c-4938-7839-1a8d-2d8ca0a1be6c ;
    p:P6366 wds:Q470813-027ECC5C-92C7-46ED-987F-884A07BF715B ;
    p:P646 wds:Q470813-F964007B-20E6-4B05-8660-B6F395FC10C5 ;
    wdtn:P6366 <https://makg.org/entity/1649724> ;
    wdt:P10283 "C1649724" ;
    wdt:P138 wd:Q730209,
        wd:Q92939 ;
    wdt:P31 wd:Q30503704,
        wd:Q504353,
        wd:Q8366 ;
    wdt:P366 wd:Q240464,
        wd:Q831366 ;
    wdt:P373 "Prim's algorithm" ;
    wdt:P3752 "<math class=\"mwe-math-element mwe-math-element-inline\" xmlns=\"http://www.w3.org/1998/Math/MathML\"><mrow data-mjx-texclass=\"ORD\"><mstyle displaystyle=\"true\" scriptlevel=\"0\"><mi>O</mi><mo stretchy=\"false\">(</mo><mo stretchy=\"false\">(</mo><mo stretchy=\"false\">|</mo><mi>V</mi><mo stretchy=\"false\">|</mo><mo stretchy=\"false\">+</mo><mo stretchy=\"false\">|</mo><mi>E</mi><mo stretchy=\"false\">|</mo><mo stretchy=\"false\">)</mo><mi>log</mi><mo>&#x2061;</mo><mo stretchy=\"false\">|</mo><mi>V</mi><mo stretchy=\"false\">|</mo><mo stretchy=\"false\">)</mo><mo stretchy=\"false\">=</mo><mi>O</mi><mo stretchy=\"false\">(</mo><mo stretchy=\"false\">|</mo><mi>E</mi><mo stretchy=\"false\">|</mo><mi>log</mi><mo>&#x2061;</mo><mo stretchy=\"false\">|</mo><mi>V</mi><mo stretchy=\"false\">|</mo><mo stretchy=\"false\">)</mo></mstyle></mrow></math>"^^<http://www.w3.org/1998/Math/MathML>,
        "<math class=\"mwe-math-element mwe-math-element-inline\" xmlns=\"http://www.w3.org/1998/Math/MathML\"><mrow data-mjx-texclass=\"ORD\"><mstyle displaystyle=\"true\" scriptlevel=\"0\"><mi>O</mi><mo stretchy=\"false\">(</mo><mo stretchy=\"false\">|</mo><mi>E</mi><mo stretchy=\"false\">|</mo><mo stretchy=\"false\">+</mo><mo stretchy=\"false\">|</mo><mi>V</mi><mo stretchy=\"false\">|</mo><mi>log</mi><mo>&#x2061;</mo><mo stretchy=\"false\">|</mo><mi>V</mi><mo stretchy=\"false\">|</mo><mo stretchy=\"false\">)</mo></mstyle></mrow></math>"^^<http://www.w3.org/1998/Math/MathML>,
        "<math class=\"mwe-math-element mwe-math-element-inline\" xmlns=\"http://www.w3.org/1998/Math/MathML\"><mrow data-mjx-texclass=\"ORD\"><mstyle displaystyle=\"true\" scriptlevel=\"0\"><mi>O</mi><mo stretchy=\"false\">(</mo><mo stretchy=\"false\">|</mo><mi>V</mi><msup><mo stretchy=\"false\">|</mo><mrow data-mjx-texclass=\"ORD\"><mn>2</mn></mrow></msup><mo stretchy=\"false\">)</mo></mstyle></mrow></math>"^^<http://www.w3.org/1998/Math/MathML> ;
    wdt:P5106 "PrimJarniacutek",
        "PrimsAlgorithm",
        "primJarnik" ;
    wdt:P61 wd:Q730209,
        wd:Q8556,
        wd:Q92939 ;
    wdt:P6366 "1649724" ;
    wdt:P646 "/m/0f2jn" .