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
Recent questions tagged graphalgorithms
0
votes
0
answers
1
Targate
Here it is mentioned as a queue and not a priority queue ,what would be the answer ?
asked
Jan 5, 2017
in
Algorithms
by
Harsh181996
Active
(
4.5k
points)

65
views
algorithms
graphalgorithms
primsalgorithm
+2
votes
1
answer
2
DFS using Stack
Could someone please explain Depth first Search using Stack? I have found different algorithms for handling the visited flag and the way the nodes are pushed. I am having problems in solving these types of questions  Find the nodes or number of nodes that are pushed onto stack more than once? Could someone please help with a small example?
asked
Dec 30, 2016
in
Algorithms
by
yg92
Active
(
3.2k
points)

1.5k
views
algorithms
dfs
treetraversal
graphalgorithms
+1
vote
1
answer
3
longest path
how can we find longest path between any pair of vertices in a garph??
asked
Dec 26, 2016
in
DS
by
Akriti sood
Boss
(
12.3k
points)

509
views
graphalgorithms
algorithms
+1
vote
1
answer
4
MadeEasy Test Series: Algorithms  Graph Algorithms
asked
Dec 14, 2016
in
Algorithms
by
rahul sharma 5
Boss
(
25.6k
points)

160
views
madeeasytestseries
algorithms
graphalgorithms
shortestpath
dijkstrasalgorithm
+1
vote
1
answer
5
MadeEasy Test Series: Algorithms  Time Complexity
#plz check??
asked
Dec 12, 2016
in
Algorithms
by
Hradesh patel
Loyal
(
6.5k
points)

124
views
madeeasytestseries
algorithms
graphalgorithms
timecomplexity
+3
votes
2
answers
6
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
(
57.2k
points)

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

796
views
graphalgorithms
shortestpath
algorithms
graphtheory
dynamicprogramming
multistagegraph
+1
vote
0
answers
8
GATE199014
The following algorithm (written in pseudopascal) work on an undirected graph G program Explore (G) procedure Visit (u) begin if Adj (u) is not empty {comment:Adj (u) is the list of edges incident to u} then begin Select an edge from Adj (u); ... edges, given that each vertex can be accessed and removed from LIST in constant time. Also show that all edges of the graph are traversed.
asked
Nov 26, 2016
in
Algorithms
by
makhdoom ghaya
Boss
(
30.8k
points)

253
views
gate1990
descriptive
graphalgorithms
unsolved
+29
votes
3
answers
9
GATE200582b
Let $s$ and $t$ be two vertices in a undirected graph $G=(V,E)$ having distinct positive edge weights. Let $[X,Y]$ be a partition of $V$ such that $s \in X$ and $t \in Y$. Consider the edge $e$ having the minimum weight amongst all those edges that have ... weighted spanning tree a weighted shortest path from $s$ to $t$ an Euler walk from $s$ to $t$ a Hamiltonian path from $s$ to $t$
asked
Nov 14, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

1.9k
views
gate2005
algorithms
graphalgorithms
normal
0
votes
0
answers
10
Gate 2016
Let G be aweighted connected undirected graph with distinct positive edge weights.If every edge weight is increased by the same value,then which of the following statements is/are TRUE? P: Minimum spanning tree of G does notchange Q: Shortest path between any pair of ... (D) Both PandQ answer is a. why not D ,I think Shortest path between any pair of vertices will also not change.
asked
Nov 6, 2016
in
Algorithms
by
vishwa ratna
Active
(
2.4k
points)

86
views
graphalgorithms
+5
votes
1
answer
11
Dijkstra's algorithm
What is the time complexity of Dijkstra’s algorithm if it is implemented using AVL Tree instead of Priority Queue over a graph G = (V, E)?
asked
Nov 5, 2016
in
Algorithms
by
vaishali jhalani
Active
(
4.8k
points)

942
views
algorithms
dijkstrasalgorithm
graphalgorithms
shortestpath
0
votes
0
answers
12
graph
Time taken in adding/removing an edge to/from adjacent list ?
asked
Nov 5, 2016
in
Algorithms
by
vaishali jhalani
Active
(
4.8k
points)

94
views
algorithms
graphalgorithms
+1
vote
1
answer
13
Dijkstra's Agorithm
When the graph contain negetive weight edges but no negetive weight cycle, in this case can dijkstra leads to incorrect result?
asked
Nov 4, 2016
in
Algorithms
by
vaishali jhalani
Active
(
4.8k
points)

349
views
algorithms
dijkstrasalgorithm
graphalgorithms
shortestpath
0
votes
1
answer
14
graph algorithm
Can we use DFS to detect the negetive weight cycle in a directed graph?
asked
Nov 4, 2016
in
Algorithms
by
vaishali jhalani
Active
(
4.8k
points)

114
views
algorithms
graphalgorithms
dfs
+2
votes
1
answer
15
minimum spanning tree
asked
Nov 4, 2016
by
vaishali jhalani
Active
(
4.8k
points)

96
views
algorithms
graphalgorithms
minimumspanningtrees
0
votes
0
answers
16
Kerala PSC AP Exam
Let G be a weighted undirected graph and e be an edge with mazimum weight in G. suppose there is a minimum weight spanning tree in G containing edge e. which of the following statements are always true? A) There exists a cutset in G having all edges of maximum ... G having all edges of maximum weight C) Edge e cannot be contained in a cycle D) All edges in G have the same weight
asked
Oct 27, 2016
in
DS
by
Sankaranarayanan P.N
Boss
(
11k
points)

83
views
graphtheory
minimumspanningtrees
graphalgorithms
+4
votes
2
answers
17
shortest path
asked
Oct 26, 2016
in
Algorithms
by
jenny101
Active
(
1.1k
points)

306
views
shortestpath
graphalgorithms
algorithms
+2
votes
1
answer
18
Shortest path length
asked
Oct 26, 2016
in
Algorithms
by
jenny101
Active
(
1.1k
points)

191
views
graphalgorithms
shortestpath
+15
votes
1
answer
19
MadeEasy Test Series: Algorithms  Graph Algorithms
For the graph given below Dijkstra's algorithm does not provide correct shortest path tree. Suppose a new graph that is different only in weight between Q to S is created. The number of values of edge [Q to S] that ensures that Dijkstra's provide the ... tree where the values of edge (Q to S) ∈ [20, 20] and P' is the source vertex are ______.
asked
Sep 24, 2016
in
Algorithms
by
User007
Active
(
1.6k
points)

918
views
madeeasytestseries
algorithms
graphalgorithms
shortestpath
dijkstrasalgorithm
+3
votes
1
answer
20
UGCNETDec2015III20
FloydWarshall algorithm utilizes _____ to solve the allpairs shortest paths problem on a directed graph in ____ time Greedy algorithm, $\theta(V^3)$ Greedy algorithm, $\theta(V^2 lgn)$ Dynamic programming, $\theta(V^3)$ Dynamic programming, $\theta(V^2 lgn)$
asked
Aug 9, 2016
in
Others
by
jothee
Veteran
(
105k
points)

652
views
ugcnetdec2015iii
graphalgorithms
+2
votes
1
answer
21
Is Bellman Ford Dynamic Programming approach ?
Is bellman ford a dynamic programming approach? If yes, what is the reason behind it? How do we find an optimal substructure and overlapping sub problems in this ?
asked
Jul 22, 2016
in
Algorithms
by
Khyati Tuli
(
157
points)

2.9k
views
algorithms
shortestpath
graphalgorithms
+1
vote
0
answers
22
MadeEasy Test Series 2015: Algorithms  Graph Algorithms
Here i have option III is doubt.how option III always correct.one counter example is if i choose a tree where s is root node and v1& v2 are its child node then above question property i.e the vertices V1 and V2 that are simultaneously ... from vertex s in a digraph is satisfies.but there is no any path from v1 to v2 or from v2 to v1.
asked
Jul 19, 2016
in
Algorithms
by
dileswar sahu
Active
(
1.1k
points)

161
views
madeeasytestseries
algorithms
graphalgorithms
dfs
+3
votes
1
answer
23
Bellman Ford Variation in Data Structures, tricky test ?
We have a Directed Graph with 100 vertexes. v1 > v2 > ... v100 and all edges weights is equal to 1. we want to used bellmanford for finding all shortest paths from v1 to other vertexes. this algorithm in each ... and maximum of steps in this problem? ُSolution says 2 and 100. anyone can say how the min and max steps is calculated?
asked
Jul 10, 2016
in
DS
by
Sara Nimlon
(
149
points)

480
views
algorithms
datastructures
graphalgorithms
shortestpath
+3
votes
2
answers
24
All pair shortest path
Algorithm which solves the all pair shortest path problem is A)Dijkstra's algorithm B)Floyd's algorith C)Prim's algorithmm D)Warshall's algorithm
asked
Jun 24, 2016
in
DS
by
vivekpinto07
(
229
points)

2.5k
views
graphalgorithms
graphtheory
+9
votes
3
answers
25
ISRO200780
Djikstra’s algorithm is used to Create LSAs Flood an internet with information Calculate the routing tables Create a link state database
asked
Jun 10, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

2.8k
views
isro2007
algorithms
graphalgorithms
shortestpath
dijkstrasalgorithm
0
votes
3
answers
26
IISCCSAResearchTest6
Someone claims that Kruskal's algorithm for finding minimum spanning tree can return different spanning trees for the same input graph $G$. Do you agree with the claim? If so, why? If not, argue briefly why the claim is incorrect.
asked
Jun 8, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

206
views
iisccsaresearch2016
descriptive
algorithms
graphalgorithms
minimumspanningtrees
iiscinterview
+1
vote
1
answer
27
ISI2014PCBCS3b
Let $G = (V, E)$ be an undirected weighted graph with all edge weights being positive. Design an efficient algorithm to find the maximum spanning tree of $G$.
asked
May 31, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

229
views
descriptive
isi2014pcbcs
algorithms
spanningtree
graphalgorithms
+4
votes
1
answer
28
CMI2012B05b
Given an undirected weighted graph $G = (V, E)$ with nonnegative edge weights, we can compute a minimum cost spanning tree $T = (V, E')$. We can also compute, for a given source vertex $s \epsilon V$ , the shortest paths from s to every ... claim the statement is true or a counterexample if the statement is false. All the shortest paths from $s$ to the other vertices are unchanged.
asked
May 27, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

334
views
cmi2012
descriptive
algorithms
graphalgorithms
minimumspanningtrees
Page:
« prev
1
2
3
4
5
6
7
8
9
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
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
Follow @csegate
Recent questions tagged graphalgorithms
Recent Blog Comments
@nkg_master9  For getting selected for the...
Nowhere it's mentioned.
@bond  Is it mentioned that you have to score at...
I think cutoff won't cross 85
Cut off will be between 95115 not more than that.
50,737
questions
57,384
answers
198,538
comments
105,332
users