|
rdfs:label
|
"A*"@cs
"A*"@ja
"A*"@nb
"A*"@ro
"A* algoritam"@sr
"A* algoritmus"@hu
"A* arama algoritması"@tr
"A* search algorithm"@en
"A* search algorithm"@en-ca
"A* search algorithm"@en-gb
"A* sökalgoritm"@sv
"A* 搜尋演算法"@yue
"A* 알고리즘"@ko
"A*-Algorithmus"@de
"A*-Algorithmus"@de-ch
"A*-algoritme"@nl
"A*-algoritmi"@fi
"A*-serĉalgoritmo"@eo
"A*搜寻算法"@zh
"Giải thuật tìm kiếm A*"@vi
"algorisme de cerca A*"@ca
"algoritem A*"@sl
"algorithme A*"@fr
"algoritma a-star"@id
"algoritmo A*"@it
"algoritmo A*"@pt
"algoritmo A*"@pt-br
"algoritmo de búsqueda A*"@es
"algorytm A*"@pl
"Алгоритъм А*"@bg
"алгоритм поиска A*"@ru
"алгоритм пошуку A*"@uk
"Ա*"@hy
"אלגוריתם חיפוש A*"@he
"الگوریتم جستجوی A*"@fa
"خوارزمية البحث بأولوية الأفضل"@ar
"การค้นหาแบบเอสตาร์"@th
|
|
skos:altLabel
|
"A Stern"@de
"A star"@en
"A star"@cs
"A star"@de
"A star"@it
"A star"@pl
"A star"@sv
"A star search algorithm"@en
"A stjärna"@sv
"A tähti"@fi
"A*"@ca
"A*"@de
"A*"@en
"A*"@es
"A*"@fi
"A*"@nl
"A*"@pl
"A*"@ru
"A*"@sv
"A*"@vi
"A*"@zh
"A* algorithm"@en
"A* search"@cs
"A* search"@en
"A* อัลกอรึทึม"@th
"A* 탐색"@ko
"A* 탐색 알고리즘"@ko
"A*アルゴリズム"@ja
"A*算法"@zh
"A-Stern-Algorithmus"@de
"A-star"@ca
"A-star"@en
"A-star"@ru
"A-star"@sv
"A-star algorithm"@en
"A-star search algorithm"@en
"A-stjärna"@sv
"AStar"@pl
"Algorisme de cerca A-star"@ca
"Aアルゴリズム"@ja
"A星算法"@zh
"GDUS"@de
"Giải thuật A*"@vi
"Thuật toán A*"@vi
"Thuật toán tìm kiếm A*"@vi
"algoritmo a*"@pt
"algoritmo de busqueda A*"@es
"algoritmo de busqueda a*"@es
"algoritmo de búsqueda a*"@es
"algoritmo di ricerca A*"@it
"algoritmul de căutare A*"@ro
"algorytm A*”"@pl
"busca A*"@pt
"А*"@ru
"алгоритм A*"@ru
"خوارزمية *A"@ar
"ขั้นตอนวิธี A*"@th
"ขั้นตอนวิธีเอ*"@th
"에이 스타 알고리즘"@ko
"에이-스타 알고리즘"@ko
"에이스타 알고리즘"@ko
|
|
schema:description
|
"Algorithmus der Graphentheorie"@de
"algorisme heurístic de cerca del camí més curt,"@ca
"algorithm used for pathfinding and graph traversal"@en
"algorithme de recherche de chemin"@fr
"algoritm"@sv
"algoritm"@ro
"algoritma"@tr
"algoritmi"@fi
"algoritmo"@es
"algoritmo de busca em grafos para encontrar caminhos"@pt
"algoritmo di ricerca"@it
"algoritmus pro hledání cesty v grafu"@cs
"sposób szukania optymalnej ścieżki w grafie ważonym"@pl
"wiskundig algoritme om het kortste pad te vinden"@nl
"алгоритм поиска"@ru
|
|
schema:dateModified
|
"2026-09-08T18:10:03+00:00"^^xsd:dateTime
|
|
schema:version
|
2542395261
|
|
wikibase:identifiers
|
10
|
|
wikibase:sitelinks
|
32
|
|
wikibase:statements
|
35
|
|
p:P10
|
wd:statement/Q277680-db6981c2-4947-151a-7b20-183591fe5b73
|
|
p:P10283
|
wd:statement/Q277680-2F565B6C-DB15-4DCD-A629-39F5A8352B01
|
|
p:P12946
|
wd:statement/Q277680-A878C2DA-8DC3-4890-9150-E8924F7BD2F1
|
|
p:P1343
|
wd:statement/Q277680-080963dc-4054-039b-620a-6c808bcb5f7f
|
|
p:P144
|
wd:statement/Q277680-9092b7a2-4d22-f1a2-a7aa-294a9b426382
|
|
p:P1552
|
wd:statement/Q277680-783525b5-4f9d-8309-38dc-4ca3919d77f7
|
|
wd:statement/Q277680-8734ca84-424a-0f91-c75d-e9c1429be3ac
|
|
wd:statement/Q277680-eb6a7357-4966-70c9-fae1-5f0714ef3e42
|
|
p:P18
|
wd:statement/Q277680-61e3337f-458e-eac2-a392-b976936ba406
|
|
p:P2159
|
wd:statement/Q277680-042879b8-40c8-8984-ffb2-853b0ce964ee
|
|
wd:statement/Q277680-3152115e-41dd-fb23-b051-775d002254f2
|
|
p:P2283
|
wd:statement/Q277680-25471F0D-BD26-44FB-A434-1E7A5BC74F12
|
|
p:P279
|
wd:statement/Q277680-b7ea57d2-4b0f-8c77-ce29-a47a3e5c20f0
|
|
p:P31
|
wd:statement/Q277680-6dcb7b37-43b0-f73d-9c0c-4d157ae94ba4
|
|
wd:statement/Q277680-72c5f767-4497-8d1a-012a-32a560b64ff0
|
|
wd:statement/Q277680-A15B7E02-6824-4962-8BEC-C650F7F7FE16
|
|
wd:statement/Q277680-fe0395d0-43fb-5f2a-2135-03f630d1baf4
|
|
p:P3417
|
wd:statement/Q277680-534688c9-4023-1371-2fff-588688b154bd
|
|
wd:statement/Q277680-821622DF-E0B5-42BC-8B47-34F8CC8F5E2E
|
|
p:P373
|
wd:statement/Q277680-d8c2c1f2-400d-a069-9117-5d13c907b01f
|
|
p:P3752
|
wd:statement/Q277680-0f0fe412-482f-fcc6-9023-7b79954337f7
|
|
wd:statement/Q277680-ccdbdf0d-4396-ef29-d8eb-50c32ae39b77
|
|
p:P3755
|
wd:statement/Q277680-4229575d-41b3-bc98-ca5f-1ff49a6929d5
|
|
p:P4969
|
wd:statement/Q277680-E73CA018-3BB6-40BF-BC36-9D6668D59BD9
|
|
p:P5047
|
wd:statement/Q277680-e5be9127-43eb-4e0b-cb1f-351f8a9b3ad4
|
|
p:P577
|
wd:statement/Q277680-103491a7-4dd4-ea15-60de-45b40616615e
|
|
p:P61
|
wd:statement/Q277680-2f8cdd94-463d-e1a8-34c2-215f6fef22f9
|
|
wd:statement/Q277680-75957ebb-4986-2b8a-6185-65002830e1a4
|
|
wd:statement/Q277680-eb3d3566-4501-bbfc-3177-78651f8505ba
|
|
p:P6366
|
wd:statement/Q277680-24804308-FCFD-4249-A800-18CE7637A18C
|
|
p:P646
|
wd:statement/Q277680-BC6A95E9-6BD3-48FE-BC8A-D6DFD3B2ABB3
|
|
p:P6564
|
wd:statement/Q277680-acdcc9e0-4a11-f5ee-2053-3765089debb2
|
|
p:P8669
|
wd:statement/Q277680-9bd50404-4ec9-2df9-a3c4-b97a469f20f2
|
|
wd:statement/Q277680-b5e03c74-4745-c9c5-2469-71c628259957
|
|
p:P935
|
wd:statement/Q277680-70F205DD-6472-45F5-AD3D-307A4A7C5060
|
|
p:direct-normalized/P6366
|
<https://makg.org/entity/103578098>
|
|
wdt:P10
|
<http://commons.wikimedia.org/wiki/Special:FilePath/Astar%20progress%20animation.gif>
|
|
wdt:P10283
|
"C103578098"
|
|
wdt:P12946
|
"A*+search"
|
|
wdt:P1343
|
Artificial Intelligence: A Modern Approach
|
|
wdt:P144
|
Dijkstra's algorithm
|
|
wdt:P1552
|
[.well-known/genid/328cab2e21a3d7e28c88649177abc300]
|
|
[.well-known/genid/7b83016e82d227efb95b1dc143aa276f]
|
|
optimal
|
|
wdt:P18
|
<http://commons.wikimedia.org/wiki/Special:FilePath/Pathfinding%20A%20Star.svg>
|
|
wdt:P2159
|
shortest path problem
|
|
pathfinding
|
|
wdt:P2283
|
graph data structure
|
|
wdt:P279
|
best-first search
|
|
wdt:P31
|
complete search algorithm
|
|
admissible search algorithm
|
|
pathfinding algorithm
|
|
graph algorithm
|
|
wdt:P3417
|
"A*-Algorithm"
|
|
"A*-Search-Algorithm"
|
|
wdt:P373
|
"A* search 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"><mrow data-mjx-texclass="ORD"><mi data-mjx-variant="-tex-calligraphic">𝒪</mi></mrow><mo stretchy="false">(</mo><mo stretchy="false">|</mo><mi>A</mi><mo stretchy="false">|</mo><mi>l</mi><mi>o</mi><mi>g</mi><mo stretchy="false">(</mo><mo stretchy="false">|</mo><mi>S</mi><mo stretchy="false">|</mo><mo stretchy="false">)</mo><mo stretchy="false">)</mo><mo stretchy="false">=</mo><mrow data-mjx-texclass="ORD"><mi data-mjx-variant="-tex-calligraphic">𝒪</mi></mrow><mo stretchy="false">(</mo><msup><mi>b</mi><mrow data-mjx-texclass="ORD"><mi>d</mi></mrow></msup><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"><mrow data-mjx-texclass="ORD"><mi data-mjx-variant="-tex-calligraphic">𝒪</mi></mrow><mo stretchy="false">(</mo><msup><mn>2</mn><mrow data-mjx-texclass="ORD"><mrow data-mjx-texclass="ORD"><mo stretchy="false">|</mo><mi>S</mi><mo stretchy="false">|</mo></mrow></mrow></msup><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"><mrow data-mjx-texclass="ORD"><mi data-mjx-variant="-tex-calligraphic">𝒪</mi></mrow><mo stretchy="false">(</mo><mo stretchy="false">|</mo><mi>S</mi><mo stretchy="false">|</mo><mo stretchy="false">)</mo><mo stretchy="false">=</mo><mrow data-mjx-texclass="ORD"><mi data-mjx-variant="-tex-calligraphic">𝒪</mi></mrow><mo stretchy="false">(</mo><msup><mi>b</mi><mrow data-mjx-texclass="ORD"><mi>d</mi></mrow></msup><mo stretchy="false">)</mo></mstyle></mrow></math>"^^http://www.w3.org/1998/Math/MathML
|
|
wdt:P4969
|
jump point search
|
|
wdt:P5047
|
"A*_search_algorithm"
|
|
wdt:P577
|
"1968-01-01T00:00:00+00:00"^^xsd:dateTime
|
|
wdt:P61
|
Bertram Raphael
|
|
Nils John Nilsson
|
|
Peter E. Hart
|
|
wdt:P6366
|
"103578098"
|
|
wdt:P646
|
"/m/0plrp"
|
|
wdt:P6564
|
"a-star-search"
|
|
wdt:P8669
|
"algoritmus-1"
|
|
wdt:P935
|
"A* Algorithm"
|
