{"id":127,"date":"2022-02-21T17:37:05","date_gmt":"2022-02-21T22:37:05","guid":{"rendered":"https:\/\/mathanimations.net\/?page_id=127"},"modified":"2022-02-21T17:37:05","modified_gmt":"2022-02-21T22:37:05","slug":"dijkstras-shortest-path-tree-algorithm","status":"publish","type":"page","link":"https:\/\/mathanimations.net\/?page_id=127","title":{"rendered":"Dijkstra&#8217;s Shortest Path Tree Algorithm"},"content":{"rendered":"\n<p>This <a href=\"http:\/\/www.mathanimations.net\/content\/Dijkstra.php\" data-type=\"URL\">animation<\/a> allows you to step through Dijkstra&#8217;s Shortest Path Tree algorithm.<\/p>\n\n\n\n<p>First, draw a graph just as in Graph Explorer, and select a root node by clicking it and pressing [R].  Press [W] to assign random weights to the edges (if you don&#8217;t like the weights you got, press [W] until you get ones you&#8217;re happier with).<\/p>\n\n\n\n<p>Pressing [A] brings up an outline of the algorithm at the left; [Space] steps through the algorithm, illustrating each step on the graph and with variables indicated above.<\/p>\n\n\n\n<figure class=\"wp-block-image size-large is-style-default\"><a href=\"http:\/\/www.mathanimations.net\/Dijkstra.php\"><img data-recalc-dims=\"1\" loading=\"lazy\" decoding=\"async\" width=\"580\" height=\"326\" src=\"https:\/\/i0.wp.com\/mathanimations.net\/wp-content\/uploads\/2022\/02\/Dijkstra.jpg?resize=580%2C326&#038;ssl=1\" alt=\"\" class=\"wp-image-128\" srcset=\"https:\/\/i0.wp.com\/mathanimations.net\/wp-content\/uploads\/2022\/02\/Dijkstra.jpg?resize=1024%2C576&amp;ssl=1 1024w, https:\/\/i0.wp.com\/mathanimations.net\/wp-content\/uploads\/2022\/02\/Dijkstra.jpg?resize=300%2C169&amp;ssl=1 300w, https:\/\/i0.wp.com\/mathanimations.net\/wp-content\/uploads\/2022\/02\/Dijkstra.jpg?resize=768%2C432&amp;ssl=1 768w, https:\/\/i0.wp.com\/mathanimations.net\/wp-content\/uploads\/2022\/02\/Dijkstra.jpg?resize=1200%2C675&amp;ssl=1 1200w, https:\/\/i0.wp.com\/mathanimations.net\/wp-content\/uploads\/2022\/02\/Dijkstra.jpg?w=1443&amp;ssl=1 1443w\" sizes=\"auto, (max-width: 580px) 100vw, 580px\" \/><\/a><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>This animation allows you to step through Dijkstra&#8217;s Shortest Path Tree algorithm. First, draw a graph just as in Graph Explorer, and select a root node by clicking it and pressing [R]. Press [W] to assign random weights to the edges (if you don&#8217;t like the weights you got, press [W] until you get ones [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"nf_dc_page":"","om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"class_list":["post-127","page","type-page","status-publish","hentry"],"jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/mathanimations.net\/index.php?rest_route=\/wp\/v2\/pages\/127","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/mathanimations.net\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/mathanimations.net\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/mathanimations.net\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/mathanimations.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=127"}],"version-history":[{"count":2,"href":"https:\/\/mathanimations.net\/index.php?rest_route=\/wp\/v2\/pages\/127\/revisions"}],"predecessor-version":[{"id":130,"href":"https:\/\/mathanimations.net\/index.php?rest_route=\/wp\/v2\/pages\/127\/revisions\/130"}],"wp:attachment":[{"href":"https:\/\/mathanimations.net\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=127"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}