{"id":2397,"date":"2020-07-21T09:19:14","date_gmt":"2020-07-21T01:19:14","guid":{"rendered":"https:\/\/people.utm.my\/saifulazimi\/?p=2397"},"modified":"2020-07-21T11:05:58","modified_gmt":"2020-07-21T03:05:58","slug":"dijkstras-algorithm","status":"publish","type":"post","link":"https:\/\/people.utm.my\/saifulazimi\/2020\/07\/21\/dijkstras-algorithm\/","title":{"rendered":"Dijkstra&#8217;s Algorithm"},"content":{"rendered":"<p>[et_pb_section fb_built=&#8221;1&#8243; _builder_version=&#8221;4.4.2&#8243;][et_pb_row _builder_version=&#8221;4.4.2&#8243;][et_pb_column type=&#8221;4_4&#8243; _builder_version=&#8221;4.4.2&#8243;][et_pb_text _builder_version=&#8221;4.4.2&#8243;]<\/p>\n<p style=\"text-align: justify\">Dijkstra&#8217;s algorithm implements the greedy approach [86] in solving the single source shortest problem by repeatedly choosing the unselected vertices, vertex ? nearest to sources ? and initialize its distance as the actual shortest distance from ? to ?. Then, the edges of ? are checked to ensure the feasibility of the computed path to the destination. This algorithm has a very low computational cost due to its ability to access only the non-negative edges.<\/p>\n<p>[\/et_pb_text][\/et_pb_column][\/et_pb_row][\/et_pb_section]<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Dijkstra&#8217;s algorithm implements the greedy approach [86] in solving the single source shortest problem by repeatedly choosing the unselected vertices, vertex ? nearest to sources ? and initialize its distance as the actual shortest distance from ? to ?. Then, the edges of ? are checked to ensure the feasibility of the computed path to [&hellip;]<\/p>\n","protected":false},"author":24953,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_et_pb_use_builder":"on","_et_pb_old_content":"","_et_gb_content_width":"","footnotes":""},"categories":[22],"tags":[],"class_list":["post-2397","post","type-post","status-publish","format-standard","hentry","category-robot-path-planning"],"_links":{"self":[{"href":"https:\/\/people.utm.my\/saifulazimi\/wp-json\/wp\/v2\/posts\/2397","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/people.utm.my\/saifulazimi\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/people.utm.my\/saifulazimi\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/people.utm.my\/saifulazimi\/wp-json\/wp\/v2\/users\/24953"}],"replies":[{"embeddable":true,"href":"https:\/\/people.utm.my\/saifulazimi\/wp-json\/wp\/v2\/comments?post=2397"}],"version-history":[{"count":3,"href":"https:\/\/people.utm.my\/saifulazimi\/wp-json\/wp\/v2\/posts\/2397\/revisions"}],"predecessor-version":[{"id":2429,"href":"https:\/\/people.utm.my\/saifulazimi\/wp-json\/wp\/v2\/posts\/2397\/revisions\/2429"}],"wp:attachment":[{"href":"https:\/\/people.utm.my\/saifulazimi\/wp-json\/wp\/v2\/media?parent=2397"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/people.utm.my\/saifulazimi\/wp-json\/wp\/v2\/categories?post=2397"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/people.utm.my\/saifulazimi\/wp-json\/wp\/v2\/tags?post=2397"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}