Chapter 40 Flashcards by Abdul Basit | Brainscape

Q

How we can prove the correctness of Dijkstra’s algorithm

A

Induction

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

What is Bellman-Ford Algorithm

A

It is just like Dijkstra algorithm with a difference that it allows negative values. It is slower than Dijkstra

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Does Bellman-Ford based on relaxation like Dijkstra

A

Yes

How well did you know this?

1

Not at all

2

3

4

5

Perfectly