Self Made

Jithin Jayan asked Jul 23, 2016 • retagged Jun 23, 2022 by Lakshman Bhaiya

386 views

1 votes

If a graph contains a positive weight cycle reachable from source, Can we find a well defined shortest path using Dijkstra/Bellman-Ford algorithm?

Algorithms
greedy-algorithm
dijkstras-algorithm
bellman-ford
shortest-path
descriptive

+ –

Jithin Jayan asked Jul 23, 2016 • retagged Jun 23, 2022 by Lakshman Bhaiya

Jithin Jayan

386 views

See all

0 Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

1 votes

Yes.

Limitations:

Dijkstra's algorithm may not work for graphs with negative weight edges.
Bellman Ford algorithm works for graphs with negative weight edges but not with negative weight cycle

sh!va answered Jul 23, 2016

sh!va

See all

0 Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

1 answer

Vipin Rai asked Nov 11, 2018

713 views

Self doubt
What is the difference between Dijkstra and Bellman Ford algorithm? Will the shortest path given by both be same in following conditions : a) All positive edge weights b) Some negative edge weights without negative edge cycle c) With negative edge cycles

What is the difference between Dijkstra and Bellman Ford algorithm?Will the shortest path given by both be same in following conditions :a) All positive edge weightsb) So...

Vipin Rai

713 views

Vipin Rai asked Nov 11, 2018

Algorithms
dijkstras-algorithm
bellman-ford
greedy-algorithm
descriptive

+ –

0 votes

1 answer

Shankar Kakde asked Jan 25, 2019

2,972 views

ME Test Series Question
Consider the following statements given below: S1 : If a graph contain a negative weight cycle then Dijkstra’s algorithm may or may not terminate. S2 : Bellman Ford algorithm for every weighted graph which contain two vertices u and v always produces a shortest path. Which of the above statements are incorrect? Only S1 Only S2 Both S1 and S2 None of these

Consider the following statements given below:S1 : If a graph contain a negative weight cycle then Dijkstra’s algorithm may or may not terminate.S2 : Bellman Ford algor...

Shankar Kakde

3.0k views

Shankar Kakde asked Jan 25, 2019

Algorithms
made-easy-test-series
dijkstras-algorithm
bellman-ford
greedy-algorithm

+ –

1 votes

1 answer

Prasanna asked Nov 29, 2015

5,125 views

Algorithms:Which of the following statements is/are true?
Which of the following statements is/are true? S1: Dijkstra's algorithm is not affected by negative edge weight cycles in the graph and gives correct shortest path. S2: Bellman ford algorithm finds all negative edge weight cycles present in the graph. a) ... Only S1 c) Both S1 and S2 d) Neither S1 and nor S2 Ans) D how ? But My ans only s2

Which of the following statements is/are true?S1: Dijkstra’s algorithm is not affected by negative edge weight cycles in the graph and gives correct shortest path.S2: B...

Prasanna

5.1k views

Prasanna asked Nov 29, 2015

Algorithms
dijkstras-algorithm
bellman-ford
shortest-path

+ –

4 votes

1 answer

Ruturaj Mohanty asked Dec 27, 2018

1,643 views

GATE Overflow | Mock GATE | Test 1 | Question: 47
Which of the following statements is/are correct with respect to Djikstra Algorithm? (P) It always works perfectly for graphs with negative weight edges. (Q) It does not work perfectly for graphs with negative weight cycles. (R) It may or may not work for graphs ... , S, T and U are correct Only Q, R, T are correct Only Q, R, S, T and U are correct

Which of the following statements is/are correct with respect to Djikstra Algorithm?(P) It always works perfectly for graphs with negative weight edges.(Q) It does not wo...

Ruturaj Mohanty

1.6k views

Ruturaj Mohanty asked Dec 27, 2018

Algorithms
go-mockgate-1
greedy-algorithm
dijkstras-algorithm
shortest-path
algorithms
graph-algorithms

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 reply

Please log in or register to add a comment.

Related questions

0

0