The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged shortestpath
0
votes
1
answer
1
Bellmann Ford Algorithm
Consider following with respect to directed graph where there can be positive,negative edge weights but no negative edge cycle. S1 : The Bellmann Ford algorithm will compute correctly the shortest path from source vertex S to every other Vertex. S2 : The Floyd Warshall ... pair of Verices. Which of Following statements are Correct ? A. Only S1 B. Only S2 C. Both D. None
asked
Oct 20, 2018
in
Algorithms
by
Na462
Loyal
(
6.7k
points)

151
views
algorithms
bellmanford
shortestpath
+1
vote
1
answer
2
How Bellman ford is dynamic programming?
What is the reason behind it? How do we find an optimal substructure and overlapping sub problems in this ? In which line of code memoization is done? BELLMANFORD(G,w,s) Code 1. INITIALIZESINGLESOURCE(G,s) 2. for i = 1 to G.V1 3. for each edge (u,v) ∈ G.E 4. RELAX(u,v,w) ... 0 RELAX(u,v,w) 1. if v.d > u.d + w(u,v) 2. v.d = u.d + w(u,v) 3. v.pi = u
asked
Aug 3, 2018
in
Algorithms
by
Sandy Sharma
Active
(
1.2k
points)

210
views
shortestpath
algorithms
graphalgorithms
bellmanford
+1
vote
0
answers
3
shortest path algo
TRUE / FALSE Explain Please.. An undirected graph is said to be Hamiltonian if it has a cycle containing all the vertices. Any DFS tree on a Hamiltonian graph must have depth V − 1.
asked
Jul 31, 2018
in
Algorithms
by
Rishav Kumar Singh
Loyal
(
5.4k
points)

78
views
graphalgorithms
shortestpath
+1
vote
1
answer
4
Space Complexity of Dijkastra's algorithm
I read that the space complexity of Dijasktra is $O(V^2)$ . (http://igraph.wikidot.com/algorithmspacetimecomplexity) But how ????
asked
Jul 5, 2018
in
Algorithms
by
Hardik Maheshwari
(
87
points)

568
views
dijkstrasalgorithm
shortestpath
spacecomplexity
algorithms
graphalgorithms
greedyalgorithm
0
votes
1
answer
5
Regarding the complexity of BellmanFord ?
In the adjacency list implementation of Bellman Ford algorithm every edge is visited at most one time and total of E are present in the adjacency list .So,how can the complexity be O(VE) why can't it be O(E) .Though it has two loops on whole it will run for E times. ??
asked
Jun 1, 2018
in
Algorithms
by
kilopavan
(
49
points)

282
views
bellmanford
shortestpath
0
votes
2
answers
6
#Algorithm Bellman Ford uses which algorithm design technique
Is it Dynamic programming?
asked
May 17, 2018
in
Algorithms
by
iarnav
Loyal
(
8k
points)

231
views
algorithms
bellmanford
shortestpath
graphalgorithms
selfdoubt
0
votes
0
answers
7
Equality of shortest path tree for given node as a root and
I have a small doubt. Chapter 25 All pairs shortest path of CLRS says following: To solve the allpairs shortestpaths problem on an input adjacency matrix, we need to compute not only the shortestpath weights but also a predecessor ... isnt both things (shortestpaths tree with root $i$ and predecessor subgraph of $G$ for $i$) the same?
asked
Mar 24, 2018
in
Programming
by
GateAspirant999
Active
(
2.4k
points)

67
views
shortestpath
algorithms
graphalgorithms
+1
vote
0
answers
8
algorithm
asked
Dec 31, 2017
in
Algorithms
by
nikkey123
Active
(
1.1k
points)

64
views
algorithms
shortestpath
0
votes
1
answer
9
shortest path
Read the following statements below For all the below questions consider the graph as simple and has positive weight edges. (i) Let the cost of the shortest path between two nodes is S.If the weight of every edge in the graph is doubled then weight of the ... We can use Kruskal's algorithm to find Minimum spanning tree of a directed graph . How many of the above statements are true.
asked
Dec 13, 2017
in
Algorithms
by
VIKAS TIWARI
Junior
(
657
points)

206
views
algorithms
shortestpath
graphalgorithms
negativecycles
+5
votes
3
answers
10
Shortest path  bellman ford and floyd warshall
Consider the following statements with respect to a directed graph G in which edges can have positive or negative edge length but that has no negative cycles: S1 : The BellmanFord algorithm correctly computes shortest path ... FloydWarshall algorithm correctly computes shortest path lengths between every pair of vertices. Which of them is correct?
asked
Dec 10, 2017
in
Algorithms
by
Tuhin Dutta
Loyal
(
9.3k
points)

833
views
algorithms
shortestpath
bellmanford
negativecycles
+5
votes
1
answer
11
TIFR2018B9
Let $G=(V,E)$ be a DIRECTED graph, where each edge $\large e$ has a positive weight $\large\omega(e),$ and all vertices can be reached from vertex $\large s.$ For each vertex $\large v,$ let $\large \phi(v)$ be the length of the shortest path from $\large s$ ... If $P$ is NOT a shortest path in $G,$ then $\omega'(P)<2\times \omega(P).$ All of the above options are necessarily TRUE.
asked
Dec 10, 2017
in
Algorithms
by
Arjun
Veteran
(
418k
points)

271
views
tifr2018
graphalgorithms
shortestpath
+3
votes
2
answers
12
Dijkstra Algorithm
asked
Dec 5, 2017
in
Algorithms
by
Parshu gate
Active
(
3.1k
points)

436
views
dijkstrasalgorithm
shortestpath
algorithms
–1
vote
1
answer
13
Dijkstra algorithm
asked
Nov 29, 2017
in
Computer Networks
by
Parshu gate
Active
(
3.1k
points)

292
views
dijkstrasalgorithm
shortestpath
computernetworks
0
votes
0
answers
14
Open Shortest Path First
asked
Nov 28, 2017
in
Computer Networks
by
Parshu gate
Active
(
3.1k
points)

119
views
shortestpath
linkstaterouting
computernetworks
+2
votes
1
answer
15
Bellman Ford
A pseudo code for Bellman Ford where each edge is relaxed k times where k>=1. Let the graph G be a simple connected and undirected graph . Let number of vertices be V, and number of edges be E . int i=1; for( i=1;i<=k;i++) { For each edge (u,v) ... . (ii) For proper running of the algorithm k can be equal to V1. (iii) For proper running of the algorithm k must be equal to E.
asked
Nov 6, 2017
in
Algorithms
by
shaurya vardhan
Active
(
2.1k
points)

223
views
algorithms
bellmanford
shortestpath
graphalgorithms
negativecycles
+1
vote
0
answers
16
Bellman Ford Algorithm (Edge sequence and convergence of algo.)
Hi Guys, As everyone knows Bellman Ford Algorithm works on DP approach. The algorithm calculate shortest paths in bottomup manner. It first calculates the shortest distances which have atmost one edge in the path. Then, ... is your opinion ? Refer > http://www.geeksforgeeks.org/dynamicprogrammingset23bellmanfordalgorithm/
asked
Nov 3, 2017
in
Algorithms
by
Chhotu
Boss
(
12.5k
points)

296
views
algorithms
shortestpath
bellmanford
graphalgorithms
+3
votes
0
answers
17
Shortest Path
First Statement is true. But I don't know about second?
asked
Nov 2, 2017
in
Algorithms
by
Shivam Chauhan
Loyal
(
8.7k
points)

178
views
shortestpath
algorithms
+7
votes
0
answers
18
Dijkstra's
I know that Dijkstra's Doesn't work for Negative weight cycle because it form a loop, Does it also true that it may or may not work for negative weight edge(without cycle) ? If it is not working for a negative weight edge(without cycle) give some example to prove it.
asked
Oct 12, 2017
in
Algorithms
by
junaid ahmad
Loyal
(
8.4k
points)

579
views
dijkstrasalgorithm
shortestpath
0
votes
3
answers
19
dijkstra
If we run Dijkstra’s algorithm to find single source shortest path for the above edge weighted directed graph with ‘8’ as source. In what order do the nodes get included into the set of vertices for which the shortest path distances are finalized.
asked
Sep 14, 2017
in
Algorithms
by
Warlock lord
Active
(
3.2k
points)

238
views
dijkstrasalgorithm
algorithms
shortestpath
+1
vote
0
answers
20
How many simple path from u to v going through w?
A complete graph on n vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vertex is repeated. Let G be a complete graph on 10 vertices. Let u, ... vertices in G. How many simple paths are there from u to v going through w? Please explain in detail. Thank you.
asked
Sep 9, 2017
in
Graph Theory
by
Hemant Parihar
Boss
(
16.1k
points)

292
views
graphtheory
shortestpath
+1
vote
3
answers
21
Shortest Path Algorithms
For a given undirected weighted graph G with V number of vertices, if you want to find all pair shortest paths then which one of the following is true ? a) run dijkstra's shortest path algorithm only once. b) run dijkstra's shortest path algorithm V times. What if the given graph is directed ?
asked
Jun 26, 2017
in
Algorithms
by
Abhisek Saha
(
145
points)

276
views
algorithms
graphalgorithms
shortestpath
+1
vote
2
answers
22
Shortest path
I have 2 doubts below, each can be True or False? a) Dijkstra's Algo will terminate even if there is a ve edge or ve cycle. b) At the termination of Bellman Ford, even if graph has ve cycle, a correct shortest path is found for a vertex for which shortest path is welldefined.
asked
May 8, 2017
in
Algorithms
by
Shyam Singh 1
Active
(
1.4k
points)

369
views
shortestpath
+2
votes
4
answers
23
Bellman Ford Shortest path
Is the below statement correct: Bellman Ford finds all negative weight cycles in the graph. This is true or false?
asked
Apr 7, 2017
in
Algorithms
by
Bongbirdie
Junior
(
681
points)

516
views
algorithms
shortestpath
bellmanford
negativecycles
+2
votes
1
answer
24
Bellman Ford
If there is a negative edge cycle present in a graph, we all know that Bellman Ford has the capability to detect it. My doubt is that, even after the presence of a negative weighted cycle, will Bellman Ford Algorithm give the correct answer or it will simply say NO..shortest path cannot be computed!?
asked
Apr 7, 2017
in
Algorithms
by
Bongbirdie
Junior
(
681
points)

248
views
shortestpath
bellmanford
algorithms
+1
vote
1
answer
25
#Totally Confused# please tell Using Dijkstra Algorithm solve shortest path algorithm from A to D.
asked
Apr 6, 2017
in
Computer Networks
by
LavTheRawkstar
Active
(
3.7k
points)

224
views
algorithms
shortestpath
dijkstrasalgorithm
computernetworks
0
votes
1
answer
26
Calculate the shortest path using TSP Greedy Appraoch
Calculate the shortest path using TSP Greedy Appraoch
asked
Mar 26, 2017
in
Algorithms
by
LavTheRawkstar
Active
(
3.7k
points)

126
views
algorithms
shortestpath
0
votes
4
answers
27
Ace Test Series
asked
Jan 14, 2017
in
Algorithms
by
Vignesh Kamath
(
251
points)

224
views
algorithms
shortestpath
acetestseries
+1
vote
1
answer
28
MadeEasy Test Series: Algorithms  Graph Algorithms
asked
Dec 14, 2016
in
Algorithms
by
rahul sharma 5
Boss
(
24.7k
points)

131
views
madeeasytestseries
algorithms
graphalgorithms
shortestpath
dijkstrasalgorithm
+3
votes
2
answers
29
shortest path
Let P be a shortest path from some vertex s to some other vertex t in a directed graph. If the weight of each edge in the graph is increased by one, P will still be a shortest path from s to t. T/F
asked
Dec 6, 2016
in
Algorithms
by
dd
Veteran
(
56.7k
points)

333
views
graphalgorithms
shortestpath
graphtheory
+1
vote
3
answers
30
Find shortest path
asked
Nov 27, 2016
in
Algorithms
by
Rakesh K
Active
(
1.8k
points)

754
views
graphalgorithms
shortestpath
algorithms
graphtheory
dynamicprogramming
multistagegraph
Page:
1
2
next »
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
GATE 2020 Application Form Opened!
My GATE Preparation Journey
ISI MTECH CS 2019 INTERVIEW EXPERIENCE
IIT HYDERABAD MTECH TA INTERVIEW EXPERIENCE
How to prepare for GATE with a fulltime job??
Follow @csegate
Recent questions tagged shortestpath
Recent Blog Comments
will pdfs be uploaded ?
6th...
Sir
4th...
49,984
questions
55,138
answers
190,498
comments
85,164
users