Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged dijkstras-algorithm
0
votes
1
answer
1
Single Source Shortest Path | Made Easy Full Syllabus Test
The answer they have given is 2, but i think it should be 1, can someone verify?
palashbehra5
asked
in
Algorithms
Jan 11
by
palashbehra5
264
views
dijkstras-algorithm
algorithms
made-easy-test-series
0
votes
1
answer
2
Nptel Assignment Question
Consider the following strategy to convert a graph with negative edge weights to one that does not have negative edge weights. Let the maximum magnitude negative edge weight in the graph be -k. Then, for each edge in the graph with weight w, ... all graphs. The claim is true for connected acyclic graphs. The claim is not true in general for connected graphs with cycles
rsansiya111
asked
in
Algorithms
Dec 8, 2021
by
rsansiya111
284
views
nptel-quiz
dijkstras-algorithm
shortest-path
graph-theory
0
votes
4
answers
3
UGC NET CSE | January 2017 | Part 3 | Question: 35
Dijkstra’s algorithm is based on Divide and conquer paradigm Dynamic programming Greedy approach Backtracking paradigm
go_editor
asked
in
Algorithms
Mar 24, 2020
by
go_editor
563
views
ugcnetcse-jan2017-paper3
algorithms
dijkstras-algorithm
2
votes
1
answer
4
Made Easy Test Series:Algorithm-Dijkstra
Which of the following procedure results same output as Dijkstra’s Algo. on unweighted graph on $'n'$ verices? $A)$ BFS $B)$ DFS $C)$Kruskal $D)$ Prims As far I know Dijkstra and Prims both have $T.C.=O(E+VlogV)$ But ans given BFS. How this ans possible??
srestha
asked
in
Algorithms
May 18, 2019
by
srestha
588
views
made-easy-test-series
dijkstras-algorithm
output
0
votes
2
answers
5
Made Easy Workbook
Suppose that you are running Dijkstra’s algorithm on the edge-weighted diagram below, starting from vertex A. The Table gives ‘Distance’ and ‘Parent’ entry of each vertex after vertex E has been deleted from the priority queue and relaxed. Vertex Distance Parent A 0 Null B 2 A C 13 F D 23 A E 11 F F 7 B G 36 F H 19 E What could be the possible value of expression x+y?
noob_coder
asked
in
Algorithms
Mar 10, 2019
by
noob_coder
1.5k
views
algorithms
graph-algorithms
dijkstras-algorithm
numerical-answers
made-easy-booklet
0
votes
2
answers
6
made easy
can anyone explain how dijkstras will behave as BFS whwn a graph is unweighted?
screddy1313
asked
in
Algorithms
Jan 26, 2019
by
screddy1313
429
views
graph-algorithms
dijkstras-algorithm
programming-in-c
made-easy-test-series
0
votes
1
answer
7
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
Shankar Kakde
asked
in
Algorithms
Jan 25, 2019
by
Shankar Kakde
2.3k
views
made-easy-test-series
dijkstras-algorithm
bellman-ford
greedy-algorithm
0
votes
0
answers
8
Dijkstra's Algorithm on negative weight cycle
Somebody please clarify me, will dijkstra’s algorithm terminate if there is a negative cycle present? (as far as I know, it doesn't give correct result as it keep updating the value, so in that logic it sould fall into infinite loop and wont terminate. Is this correct?)
anisha007
asked
in
Algorithms
Jan 25, 2019
by
anisha007
1.3k
views
dijkstras-algorithm
4
votes
1
answer
9
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
Ruturaj Mohanty
asked
in
Algorithms
Dec 27, 2018
by
Ruturaj Mohanty
1.1k
views
go-mockgate-1
greedy-algorithm
dijkstras-algorithm
shortest-path
algorithms
graph-algorithms
0
votes
0
answers
10
Self Doubt
Dijkstra Algo terminates and produce wrong result when graph contain negative wt Cycle What about Belman Ford??and FloydWarshall???
Abhisek Tiwari 4
asked
in
Algorithms
Nov 28, 2018
by
Abhisek Tiwari 4
86
views
dijkstras-algorithm
graph-algorithms
0
votes
0
answers
11
#SELF DOUBT
Prove dijkstra’s algorithm using Heap is O((n+|E|)logn) where n is no.of vertices and |E| is number of edges? Book : Fundamentals of Computer Algorithms By sahni page : 263
OneZero
asked
in
Algorithms
Nov 28, 2018
by
OneZero
180
views
dijkstras-algorithm
time-complexity
1
vote
0
answers
12
made easy
Piyush mishra
asked
in
Algorithms
Nov 26, 2018
by
Piyush mishra
160
views
dijkstras-algorithm
0
votes
1
answer
13
#doubt
difference between Bellmann ford and dijkstra's algorithm for -ve weight cycle graph
amit166
asked
in
Algorithms
Nov 22, 2018
by
amit166
164
views
dijkstras-algorithm
0
votes
0
answers
14
ACE Test Series
ben10
asked
in
Algorithms
Nov 18, 2018
by
ben10
399
views
dijkstras-algorithm
0
votes
2
answers
15
METest_Algo
I think the past cost to G from A as computed by Dijkstra should be 2 instead of 8. Please help me verify it.
Ayush Upadhyaya
asked
in
Algorithms
Nov 18, 2018
by
Ayush Upadhyaya
367
views
algorithms
dijkstras-algorithm
made-easy-test-series
numerical-answers
0
votes
1
answer
16
self doubt about dijkistra algorithm negative cycle
Will dijkistra fail if a graph has negative weight cycle which is unreachable from source????
adeemajain
asked
in
Algorithms
Nov 17, 2018
by
adeemajain
170
views
dijkstras-algorithm
0
votes
1
answer
17
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
Vipin Rai
asked
in
Algorithms
Nov 11, 2018
by
Vipin Rai
356
views
dijkstras-algorithm
bellman-ford
greedy-algorithm
descriptive
0
votes
0
answers
18
Data Structure Decrease Key Extract Min
Why Decrease Key operation we do only on edges and Extract Min operation do only on vertices? (I mean why Decrease key cannot operate on both edges and vertices?)
srestha
asked
in
DS
Oct 30, 2018
by
srestha
402
views
dijkstras-algorithm
0
votes
0
answers
19
#testbook_testseries
Anil Ji
asked
in
Algorithms
Sep 5, 2018
by
Anil Ji
93
views
dijkstras-algorithm
0
votes
0
answers
20
Greedy Techniques
hello everyone, I think that that the worst case time complexity of the dijkstra's algorithm is O(Elog(V)) and for the situation when a complete graph is considered, this will change to O(V^2(log(V))). ..( i am following the heap , extract min, and decrease key ... E +V(logV)), which for the complete graph changed to O(n^2 + V(logV)). Please let me know if my reasoning is wrong.
hrcule
asked
in
Algorithms
Sep 4, 2018
by
hrcule
128
views
dijkstras-algorithm
0
votes
0
answers
21
Made easy test series
What is meant by wrong path in Dijikstra's algo. Can anyone please explain
Ashok
asked
in
Algorithms
Sep 2, 2018
by
Ashok
139
views
dijkstras-algorithm
Page:
1
2
3
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
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
Recent Posts
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent questions tagged dijkstras-algorithm
Recent Blog Comments
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
@GO Classes @Deepak Poonia @Sachin...
@GO Classes @Deepak Poonia sir...
Maximum age limit changed from 35 yrs. to 28...