File:Dijkstra s algorithm explained.webm
Jump to navigation
Jump to search
Size of this JPG preview of this WEBM file: 800 × 450 pixels. Other resolutions: 320 × 180 pixels | 640 × 360 pixels | 1,024 × 576 pixels | 1,280 × 720 pixels | 1,920 × 1,080 pixels.
Original file (WebM audio/video file, VP9/Opus, length 3 min 34 s, 1,920 × 1,080 pixels, 191 kbps overall, file size: 4.87 MB)
Captions
Captions
Tutorial of the Dijkstra's algorithm for finding the shortest path between nodes in a network.
Summary[edit]
| Description |
English: Tutorial of the Dijkstra's algorithm for finding the shortest path between nodes in a network.
Čeština: Vysvětlení funkce Dijkstrova algoritmu pro nalezení nejkratší cesty v grafu, prakticky například propojení jednotlich bodů na mapě. Algoritmus byl vytvořen nizozemským informatikem Edsgerem Dijkstrou v roce 1956 a publikován o tři roky později.
Эрзянь: Дейкстрань алгоритмань толковомась, кона невти кавто таркань юткова нурька кинть. Тень арсизе Эдсгер В. Дейкстра голандонь тонадей 1956-це иестэ, ды колмо иень ютазь ульнесь публиковазь.
Polski: Wyjaśnienie algorytmu Dijkstry wyszukiwania najkrótszej ścieżki w grafie, który może reprezentować na przykład sieć drogową. Algorytm został opracowany przez holenderskiego informatyka Edsgera Dijkstrę w 1956 roku i opublikowany trzy lata później.
Русский: Объяснение алгоритма Дейкстры для нахождения кратчайших путей между узлами в графе, который может представлять, например, сеть автомобильных дорог. Он был задуман нидерландским учёным-компьютерщиком Эдсгером Дейкстрой в 1956 году и опубликован три года спустя. |
| Date | |
| Source | YouTube: Dijkstra's algorithm explained – View/save archived versions on archive.org and archive.today |
| Author | Jaakko |
Assessment[edit]
|
This file was selected as the media of the day for 2 May 2020. It was captioned as follows:
English: Explanation of the Dijkstra's algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by Dutch computer scientist Edsger W. Dijkstra in 1956 and published three years later.
Other languages
Čeština: Vysvětlení funkce Dijkstrova algoritmu pro nalezení nejkratší cesty v grafu, prakticky například propojení jednotlich bodů na mapě. Algoritmus byl vytvořen nizozemským informatikem Edsgerem Dijkstrou v roce 1956 a publikován o tři roky později. English: Explanation of the Dijkstra's algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by Dutch computer scientist Edsger W. Dijkstra in 1956 and published three years later. Français : Explication de l'algorithme de Dijkstra pour trouver les chemins les plus courts entre les noeuds d'un graphe représentant par exemple un réseau routier. Il a été conçu par l'informaticien néerlandais Edsger W. Dijkstra en 1956 et publié trois ans plus tard. Эрзянь: Дейкстрань алгоритмань толковомась, кона невти кавто таркань юткова нурька кинть. Тень арсизе Эдсгер В. Дейкстра голандонь тонадей 1956-це иестэ, ды колмо иень ютазь ульнесь публиковазь. Polski: Wyjaśnienie algorytmu Dijkstry wyszukiwania najkrótszej ścieżki w grafie, który może reprezentować na przykład sieć drogową. Algorytm został opracowany przez holenderskiego informatyka Edsgera Dijkstrę w 1956 roku i opublikowany trzy lata później. Русский: Объяснение алгоритма Дейкстры для нахождения кратчайших путей между узлами в графе, который может представлять, например, сеть автомобильных дорог. Он был задуман нидерландским учёным-компьютерщиком Эдсгером Дейкстрой в 1956 году и опубликован три года спустя.
|
Licensing[edit]
.svg){kind=icon}
This video, screenshot or audio excerpt was originally uploaded on YouTube under a CC license.
Their website states: "YouTube allows users to mark their videos with a Creative Commons CC BY license."
To the uploader: You must provide a link (URL) to the original file and the authorship information if available.
This file is licensed under the Creative Commons Attribution 3.0 Unported license.
Attribution: Jaakko
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
|
This file, which was originally posted to YouTube: Dijkstra's algorithm explained, was reviewed on 27 April 2020 by the automatic software YouTubeReviewBot, which confirmed that this video was available there under the stated Creative Commons license on that date. This file should not be deleted if the license has changed in the meantime. The Creative Commons license is irrevocable.
The bot only checks for the license, human review is still required to check if the video is a derivative work, has freedom of panorama related issues and other copyright problems that might be present in the video. Visit licensing for more information. If you are a license reviewer, you can review this file by manually appending |
|
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 18:08, 27 April 2020 | 3 min 34 s, 1,920 × 1,080 (4.87 MB) | Eatcha (talk | contribs) | Imported media from uploads:fc055494-88aa-11ea-ad46-162e1bb092a6 |
You cannot overwrite this file.
File usage on Commons
The following 11 pages use this file:
- User:Atlasowa/New video2commons/2020 April 21-30
- User talk:Eatcha/Archive/2020
- Template:Motd/2020-05
- Template:Motd/2020-05-02
- Template:Motd/2020-05-02 (cs)
- Template:Motd/2020-05-02 (en)
- Template:Motd/2020-05-02 (fr)
- Template:Motd/2020-05-02 (myv)
- Template:Motd/2020-05-02 (pl)
- Template:Motd/2020-05-02 (ru)
- Template:Potd/2020-05
Transcode status
Update transcode statusFile usage on other wikis
The following other wikis use this file:
- Usage on tt.wikipedia.org
- Usage on vep.wikipedia.org