@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:Q816022 rdfs:label "خوارزمية بلمان فورد"@ar,
        "Алгоритъм на Белман-Форд"@bg,
        "algorisme de Bellman-Ford"@ca,
        "Bellmanův-Fordův algoritmus"@cs,
        "Bellman-Ford-Algorithmus"@de,
        "Bellman–Ford algorithm"@en,
        "Bellman-Ford-algoritmo"@eo,
        "algoritmo de Bellman–Ford"@es,
        "الگوریتم بلمن–فورد"@fa,
        "Bellmanin–Fordin algoritmi"@fi,
        "algorithme de Bellman-Ford"@fr,
        "אלגוריתם בלמן-פורד"@he,
        "बेलमैन-फोर्ड एल्गोरिथ्म"@hi,
        "Bellman–Ford-algoritmus"@hu,
        "Բելլաման - Ֆորդի ալգորիթմ"@hy,
        "Algoritma Bellman-Ford"@id,
        "algoritmo di Bellman–Ford"@it,
        "ベルマン-フォード法"@ja,
        "ბელმან-ფორდის ალგორითმი"@ka,
        "벨만-포드 알고리즘"@ko,
        "Belmano–Fordo algoritmas"@lt,
        "Bellmana-Forda algoritms"@lv,
        "Белман-Фордов алгоритам"@mk,
        "Algoritme van Bellman-Ford"@nl,
        "algorytm Bellmana-Forda"@pl,
        "algoritmo de Bellman-Ford"@pt,
        "algoritmo de Bellman-Ford"@pt-br,
        "Алгоритм Беллмана — Форда"@ru,
        "Белман-Фордов алгоритам"@sr,
        "ขั้นตอนวิธีของเบลแมน-ฟอร์ด"@th,
        "Алгоритм Беллмана—Форда"@uk,
        "Thuật toán Bellman-Ford"@vi,
        "贝尔曼-福特算法"@zh ;
    schema1:dateModified "2026-02-17T11:37:05+00:00"^^xsd:dateTime ;
    schema1:description "خوارزمية لإيجاد أقصر مسار من عقدة محددة نحو كل عقد بيان"@ar,
        "Handlungsvorschrift aus der Graphentheorie"@de,
        "algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative"@en,
        "algoritmi lyhimmän polun etsimiseen graafissa, jossa on kaarella voi olla negatiivinen paino"@fi,
        "calcul des plus courts chemins depuis un sommet source donné dans un graphe orienté pondéré"@fr,
        "algoritmo per trovare in un grafo con pesi negativi il percorso più breve da una sorgente singola"@it,
        "алгоритм поиска кратчайшего расстояния от данной вершины до всех остальных во взвешенном графе"@ru ;
    schema1:version 2464157367 ;
    wikibase:identifiers 6 ;
    wikibase:sitelinks 30 ;
    wikibase:statements 25 ;
    skos:altLabel "Bellman-Fordův algoritmus"@cs,
        "Algorithmus von Bellman und Ford"@de,
        "Bellman-Ford"@de,
        "Bellman-Ford-Moore-Algorithmus"@de,
        "Bellmann-Ford"@de,
        "Moore-Bellman-Ford-Algorithmus"@de,
        "Bellman-Ford equation"@en,
        "Bellman–Ford–Moore algorithm"@en,
        "distance-vector routing algorithm"@en,
        "الگوریتم بلمن-فورد"@fa,
        "Bellman-Ford"@fr,
        "algorithme de Ford-Bellman"@fr,
        "אלגוריתם בלמן פורד"@he,
        "Bellman–Ford–Moore-algoritmus"@hu,
        "algoritmo di Bellman–Ford–Moore"@it,
        "algorytm Forda-Bellmana"@pl,
        "Алгоритм Беллмана-Форда"@ru,
        "Алгоритм Беллмана-Форда"@uk,
        "Bellman-Ford"@zh,
        "Bellman-Ford算法"@zh,
        "Bellman-ford"@zh,
        "Bellman-ford算法"@zh,
        "SPFA"@zh,
        "SPFA算法"@zh,
        "Shortest Path Faster Algorithm"@zh ;
    p:P138 wds:q816022-3ce8e24a-4002-388f-61f3-b24222add762,
        wds:q816022-a1e24618-4989-5725-922a-64d2291f209c ;
    p:P1535 wds:Q816022-1869af64-46a3-be78-ff31-feb2ccb4dcde ;
    p:P18 wds:Q816022-19d21e55-4b70-4b99-c970-2adf6fcfbedf ;
    p:P2159 wds:Q816022-9bf0aabb-45e8-480c-65e7-f0731fba3882,
        wds:Q816022-ac18511f-4d26-a8fc-3a0e-57680415a324 ;
    p:P2283 wds:Q816022-6008E27E-B30C-4FA7-B97B-1CEF31802F78 ;
    p:P31 wds:Q816022-5C6EF72A-925C-4E20-9B39-9CD0B499CC53,
        wds:Q816022-6a7cbd06-4c46-b4e7-db2e-60ff3ca757ad,
        wds:Q816022-C83C7C8C-C04F-47FE-9CB0-9085B8D8E388 ;
    p:P373 wds:Q816022-7aa50a6c-2d67-4377-9dc8-4e29a223521f ;
    p:P3752 wds:Q816022-c87cbf3f-402f-2496-3089-a20cf33e87b5 ;
    p:P3753 wds:Q816022-D4BAB052-C94F-47B2-93AE-B4ECD1C27DD2 ;
    p:P3755 wds:Q816022-39C90448-06CA-4BEA-B88F-686B26E8C5D3 ;
    p:P4969 wds:Q816022-33e4c1fe-4afb-d639-fcde-44522fa61b97,
        wds:Q816022-ee46910b-4bbf-dfce-346b-8a66b4485287 ;
    p:P5106 wds:Q816022-496A4572-68F7-44DD-98CF-D7E5C53AB2C4,
        wds:Q816022-86FC9D52-84C4-44C4-BFF1-F753005E7519 ;
    p:P61 wds:Q816022-181761d1-464b-fd00-d152-d83dc4f4ea20,
        wds:Q816022-9697d8de-4992-7db3-61e7-9a75688fd268,
        wds:Q816022-b0a26925-4acf-7184-1ff4-bb38b5600a2c ;
    p:P6366 wds:Q816022-CE210C13-0BFB-463B-ADFC-D20A6806CB18 ;
    p:P646 wds:Q816022-70944DCC-EE0F-4E12-BC4B-687D8A755DDB ;
    p:P6564 wds:Q816022-0fcbe532-4ac2-3f1d-65b5-01f471feca92 ;
    p:P9100 wds:Q816022-DB551792-3B3E-4751-8991-4F2FC8368121 ;
    wdtn:P6366 <https://makg.org/entity/2780110560> ;
    wdt:P138 wd:Q1820973,
        wd:Q441199 ;
    wdt:P1535 wd:Q1229441 ;
    wdt:P18 <http://commons.wikimedia.org/wiki/Special:FilePath/Bellman%E2%80%93Ford%20algorithm%20example.gif> ;
    wdt:P2159 wd:Q105136353,
        wd:Q1058754 ;
    wdt:P2283 wd:Q2479726 ;
    wdt:P31 wd:Q21595855,
        wd:Q24034552,
        wd:Q30503704 ;
    wdt:P373 "Bellman–Ford 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 mathvariant=\"normal\">&#x0398;</mi><mo stretchy=\"false\">(</mo><mo stretchy=\"false\">|</mo><mi>V</mi><mo stretchy=\"false\">|</mo><mo stretchy=\"false\">|</mo><mi>E</mi><mo stretchy=\"false\">|</mo><mo stretchy=\"false\">)</mo></mstyle></mrow></math>"^^<http://www.w3.org/1998/Math/MathML> ;
    wdt:P3753 "<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 mathvariant=\"normal\">&#x0398;</mi><mo stretchy=\"false\">(</mo><mo stretchy=\"false\">|</mo><mi>E</mi><mo stretchy=\"false\">|</mo><mo stretchy=\"false\">)</mo></mstyle></mrow></math>"^^<http://www.w3.org/1998/Math/MathML> ;
    wdt:P3755 "<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 mathvariant=\"normal\">&#x0398;</mi><mo stretchy=\"false\">(</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> ;
    wdt:P4969 wd:Q207580,
        wd:Q797622 ;
    wdt:P5106 "FordBellman",
        "bellmanford" ;
    wdt:P61 wd:Q1820973,
        wd:Q441199,
        wd:Q92882 ;
    wdt:P6366 "2780110560" ;
    wdt:P646 "/m/01g933" ;
    wdt:P6564 "bellman-ford-algorithm" ;
    wdt:P9100 "bellman-ford-algorithm" .

