File:Dijkstras progress animation.gif

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search

Dijkstras_progress_animation.gif (210 × 210 pixels, file size: 128 KB, MIME type: image/gif, looped, 382 frames, 43 s)

Captions

Captions

Add a one-line explanation of what this file represents
Description
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.
Date
Source Own work
Author Subh83
Permission
(Reusing this file)
w:en:Creative Commons
attribution
This file is licensed under the Creative Commons Attribution 3.0 Unported license.
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.

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current23:11, 14 April 2011Thumbnail for version as of 23:11, 14 April 2011210 × 210 (128 KB)Subh83 (talk | contribs){{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

There are no pages that use this file.

File usage on other wikis

The following other wikis use this file:

View more global usage of this file.