You are not logged in. Please login at www.codechef.com to post your questions!

×

Doubt Clarification!!

What type of approach does Dijkastra algo uses: Dp or Greedy?? also about Bellman ford algo??

asked 16 Mar '15, 18:48

chaman_amit's gravatar image

1★chaman_amit
871413
accept rate: 0%


ACtually Djikstra can be regarded as both dp and greedy ... It greedily selects the minimum weight node that has not yet been processed .Moreover , after that it check whether the value is global optimum or not using dp . There is always a debate on the Djikstra's Algo for this ..You can read more at this


Bellman Ford Algo is Dynamic Programming without any doubts .. You can learn this algo at the link of geeksforgeeks

link

answered 18 Mar '15, 11:51

nickzuck_007's gravatar image

3★nickzuck_007
191622
accept rate: 14%

toggle preview
Preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:

×316
×21

question asked: 16 Mar '15, 18:48

question was seen: 825 times

last updated: 18 Mar '15, 11:51