File:Dijkstras progress animation.gif
Од Wikimedia Commons
Прејди на прегледникот
Прејди на пребарувањето
Dijkstras_progress_animation.gif (210 × 210 пиксели, големина: 128 КБ, MIME-тип: image/gif, кружно, 382 кадри, 43 с)
Информации за податотеката
Структурирани податоци
Описи
ОписDijkstras progress animation.gif |
English: Illustration of Dijkstra's algorithm. The graph is created by uniform square discretization of a 2-dimensional planar region, placing a node in each discretized cell, and connecting each node with its 8 neighbors using bidirectional edges. Cost of edges are same as their Euclidean lengths. The gray shape represents an obstacle. The filled circles in red & green represent expanded nodes (nodes in closed set). The color indicate the distance (in the graph) of a node from the start node (red: lower, green: higher). The empty nodes with blue boundary are the ones in open set. The nodes of the graph are generated on the fly, and nodes falling inside the obstacle are discarded as inaccessible. Note that Dijkstra's is a special case of the A* search algorithm when the heuristic is identically 0. Note how the nodes are expanded almost uniformly in all directions. The number of nodes expanded is significantly higher when compared with the same search problem solved using A* search algorithm.
Created using YGSBPL graph-search library and OpenCV. |
Датум | |
Извор | сопствено дело |
Автор | Subh83 |
Дозвола (Повторно користење на податотекава) |
Оваа податотека е под лиценцата Криејтив комонс Наведи извор 3.0 Нелокализирана.
|
Историја на податотеката
Стиснете на датум/време за да ја видите податотеката како изгледала тогаш.
Датум/време | Минијатура | Димензии | Корисник | Коментар | |
---|---|---|---|---|---|
тековна | 23:11, 14 април 2011 | 210 × 210 (128 КБ) | Subh83 (разговор | придонеси) | {{Information |Description ={{en|1=Illustration of [http://en.wikipedia.org/wiki/Dijkstra's_algorithm Dijkstra's algorithm]. The [http://en.wikipedia.org/wiki/Graph_(mathematics) graph] is created by uniform square discretization of a 2-dimensional pla |
Не можете да презапишете врз податотекава.
Употреба на податотеката
Нема страници што ја користат оваа податотека.
Глобална употреба на податотеката
Оваа податотека ја користат и следниве викија:
- Употреба на ar.wikipedia.org
- Употреба на cy.wikipedia.org
- Употреба на en.wikipedia.org
- Dijkstra's algorithm
- Talk:A* search algorithm
- User talk:LutherBlissetts
- User:Subh83/CommonsContrib
- User talk:Newyorkadam
- User talk:Muffin Wizard/Archive 5
- User talk:PWNGWN
- User talk:Panpog1
- User talk:Teb00007
- User talk:Sahara4u/Archive 4
- User talk:Ryan115
- User talk:A.Minkowiski
- User talk:The boss 1998
- User talk:Simon Adler/Archive 1
- User talk:Geirfuglasker
- User talk:EMachine03/Archive
- User talk:BluJay
- User:MrWooHoo/Archive 8
- User talk:TheEditor867
- User talk:CrawfordLou
- User talk:CryOCed
- User talk:Dominoooo's
- User talk:Picomtn
- User talk:Timdwilliamson/AfI
- User talk:ChrisGualtieri/Archive 31
- User talk:CSJJ104/Archive 2
- User talk:Airplane Maniac/Archive 2
- User talk:Theopolisme/Archive 25
- User talk:NickPenguin/Archive 7
- User talk:GiantSnowman/2017
- User talk:Evad37/Archive 6
- User talk:Valereee/Archive 9
- User talk:HectorAE/Archive 4
- User talk:Bananasoldier/Archive 5
- User talk:MusikAnimal/Archive 37
- User talk:Winner 42/Archive 17
- User talk:-revi/Archive 11
- Wikipedia talk:Articles for improvement/Archive 21
- User talk:CookieMonster755/Archive/2017
- User talk:Presidentman/Archives/ 29
- User talk:Rystheguy/Archive 8
- User talk:Mahensingha/Archive 46
- User talk:Sam Sailor/Archive 16
- User talk:Wikiuser13/Archive 45
- User talk:Ypnypn/Archive 14
- User talk:BabbaQ/Archive 4
- User talk:CaroleHenson/Archive 13
- User talk:Northamerica1000/Archive 73
Погледајте ја останатата глобална употреба на податотекава.