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
1
answer
1
Graph
How to solve this question ? Plz describe the detailed solution .
asked
Sep 30, 2017
in
Algorithms
by
ashwina
Active
(
1.8k
points)

88
views
algorithms
graphalgorithms
0
votes
0
answers
2
Floydwarshall for longest path problem
I have few doubts related to Longest distance problem. From Wikipedia > The NPhardness of the unweighted longest path problem can be shown using a reduction from the Hamiltonian path problem: a graph G has a ... normal algorithm as asked in (https://stackoverflow.com/questions/42500120/floydwarshallforlongestdistanceforundirectedgraph)
asked
Sep 8, 2017
in
Algorithms
by
Chhotu
Boss
(
13.7k
points)

571
views
graphalgorithms
dynamicprogramming
+3
votes
2
answers
3
Graph_Traversal
asked
Aug 30, 2017
in
DS
by
Gate Ranker18
Active
(
2.8k
points)

128
views
graphalgorithms
dfs
bfs
0
votes
1
answer
4
BFS DFS
suppose there are N number of nodes. How many ways we can write DFS and BFS sequence for it. how many are the valid sequence??? how many are invalid?? can we generalized the formula for it??
asked
Aug 22, 2017
in
DS
by
Hira Thakur
Boss
(
15k
points)

236
views
graphalgorithms
0
votes
1
answer
5
DFS back edge
If a directed graph G is cyclic but can be made acyclic by removing 1 edge then a DFS will encounter exactly 1 Backedge. True or false ?
asked
Aug 20, 2017
in
Programming
by
Xylene
Active
(
3.6k
points)

532
views
dfs
algorithms
graphalgorithms
+1
vote
0
answers
6
prims algo from cormen
Here the graph that I was trying to find MST using algo in cormen.(If you need algo to ask, I supposed you have it) Algorithms uses min queue in process, my dobut is when it came to choice b/w vertex 'c' and 'd' as at that time both will ... wrong answer, so prism deal with this case? If you need algo I will given you, or just please refer chapter 23 cormen prim's algorithm.
asked
Aug 5, 2017
in
Algorithms
by
bhuv
Active
(
4.8k
points)

284
views
graphalgorithms
primsalgorithm
algorithms
+2
votes
1
answer
7
Graph
The problem of finding the set of vertices reachable from a given vertex in a graph can be solved in time A. O(V^2) B. O(V + E) C. O(VE) D. none of these
asked
Jul 15, 2017
in
Algorithms
by
Abhisek Saha
(
151
points)

74
views
graph
graphalgorithms
+1
vote
3
answers
8
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
(
151
points)

289
views
algorithms
graphalgorithms
shortestpath
+9
votes
8
answers
9
ISRO201717
Which of the following data structure is useful in traversing a given graph by breadth first search? Stack Queue List None of the above
asked
May 10, 2017
in
Algorithms
by
Arjun
Veteran
(
431k
points)

5.6k
views
isro2017
datastructures
graphalgorithms
bfs
easy
+5
votes
5
answers
10
ISRO201776
Which of the following algorithms solves the all pair shortest path problem? Prim's algorithm Dijkstra's algorithm Bellman ford algorithm Floyd warshalls algorithm
asked
May 7, 2017
in
Algorithms
by
sh!va
Boss
(
33k
points)

2.6k
views
isro2017
algorithms
graphalgorithms
+1
vote
0
answers
11
internal path length of complete binary tree
can someone pls explain how is the internal path length of complete binary tree is O(n logn)? (if it is correct)
asked
Mar 24, 2017
in
Algorithms
by
Akriti sood
Boss
(
12.2k
points)

657
views
al
binarytree
datastructures
graphalgorithms
0
votes
1
answer
12
ME Testseries
how many of the above statements are true?
asked
Mar 13, 2017
in
Algorithms
by
Shubhanshu
Boss
(
18.3k
points)

102
views
graphalgorithms
+29
votes
4
answers
13
GATE2017126
Let $G=\left ( V,E \right )$ be $any$ connected, undirected, edgeweighted graph. The weights of the edges in $E$ are positive and distinct. Consider the following statements: Minimum Spanning Tree of $G$ is always unique. Shortest path between any two vertices of $G$ is always unique. Which of the above statements is/are necessarily true? I only II only both I and II neither I nor II
asked
Feb 14, 2017
in
Algorithms
by
Arjun
Veteran
(
431k
points)

3.6k
views
gate20171
algorithms
graphalgorithms
normal
+21
votes
5
answers
14
GATE2017215
The Breadth First Search (BFS) algorithm has been implemented using the queue data structure. Which one of the following is a possible order of visiting the nodes in the graph below? $\text{MNOPQR}$ $\text{NQMPOR}$ $\text{QMNROP}$ $\text{POQNMR}$
asked
Feb 14, 2017
in
Algorithms
by
Madhav
Active
(
1.6k
points)

1.9k
views
gate20172
algorithms
graphalgorithms
0
votes
0
answers
15
How to Calculate No of Simple graph with labelled vertices?
No of Simple Undirected Graph with unablled vertices  2nC2 No of Simple Undirected Graph with labelled vertices  ? No of Simple Undirected Connected Graph with unablled vertices  ? No of Simple Undirected Connected Graph with labelled vertices  ?
asked
Feb 5, 2017
in
Programming
by
yg92
Active
(
3.2k
points)

137
views
graphtheory
graphalgorithms
datastructures
algorithms
permutationandcombination
0
votes
1
answer
16
MadeEasy Subject Test: Algorithms  Graph Algorithms
Will dijiktras's algoritm fail for the graph given in the question (or the question has been framed wrongly)?
asked
Feb 5, 2017
in
Algorithms
by
Raj Krishna
(
11
points)

119
views
madeeasytestseries
algorithms
graphalgorithms
+2
votes
0
answers
17
Minimum Spanning Tree
Show the different minimum spanning Trees Possible in each of the following Algorithms Prims Algorithm Kruskal
asked
Jan 26, 2017
in
Algorithms
by
Dulqar
Active
(
2.5k
points)

161
views
minimumspanningtrees
algorithms
graphalgorithms
+1
vote
2
answers
18
MadeEasy CBT 2017: Algorithms  Graph Algorithms
asked
Jan 24, 2017
in
Algorithms
by
vaishali jhalani
Active
(
4.8k
points)

1.4k
views
madeeasytestseries
cbt2017
algorithms
graphalgorithms
+3
votes
2
answers
19
Difference between Kruskal's and Prim's algorithm ?
It may be the case that "Kruskal's Algorithm may not maintain connectivity while Prim's algorithm always does that" ? Any example which favours this ?
asked
Jan 24, 2017
in
Algorithms
by
Kapil
Veteran
(
50.9k
points)

1.9k
views
algorithms
graphalgorithms
kruskalsalgorithm
primsalgorithm
0
votes
1
answer
20
MadeEasy Subject Test: Algorithms  Graph Algorithms
Which of the following statements is true? Adding a constant to every edge weight in a directed graph can change the set of edges that belongs to minimum cost spanning tree. Assume unique weights. Complete graph with 4 vertices, each edges ... ). None of these how is 3rd wrong? If there is no negative cycles dijkstra can work just fine right?
asked
Jan 24, 2017
in
Algorithms
by
S Ram
Active
(
1.7k
points)

169
views
madeeasytestseries
algorithms
graphalgorithms
+1
vote
2
answers
21
Minimum Spanning Tree ( TestBook Test Series 2)
asked
Jan 23, 2017
in
DS
by
biranchi
Active
(
1.3k
points)

149
views
minimumspanningtrees
graphalgorithms
+2
votes
1
answer
22
MadeEasy CBT 2017: Algorithms  Graph Algorithms
asked
Jan 23, 2017
in
Algorithms
by
Dulqar
Active
(
2.5k
points)

265
views
madeeasytestseries
cbt2017
algorithms
graphalgorithms
+3
votes
3
answers
23
MadeEasy CBT 2017: Algorithms  Graph Algorithms
No of topological sortings
asked
Jan 23, 2017
in
Algorithms
by
Vasu_gate2017
Active
(
1.1k
points)

685
views
madeeasytestseries
cbt2017
algorithms
graphalgorithms
topologicalsort
+1
vote
1
answer
24
MadeEasy Subject Test: Algorithms  Graph Algorithms
Which of the following statements is true? Adding a constant to every edge weight in a directed graph can change the set of edges that belongs to minimum cost spanning tree. Assume unique weights. Complete graph with 4 vertices, each edges ... ). None of these how is 3rd wrong? If there is no negative cycles dijkstra can work just fine right?
asked
Jan 20, 2017
in
Algorithms
by
Pankaj Joshi
Active
(
2.7k
points)

723
views
madeeasytestseries
algorithms
graphalgorithms
dijkstrasalgorithm
+1
vote
1
answer
25
Algorithms, Graph theory
How to find number of BFS and DFS traversals for any complete graph? I am trying to find a formula for it.
asked
Jan 12, 2017
in
Algorithms
by
Krupa Rajani
(
203
points)

246
views
bfs
dfs
graphalgorithms
0
votes
1
answer
26
Back Edge
asked
Jan 7, 2017
in
Algorithms
by
vaishali jhalani
Active
(
4.8k
points)

316
views
algorithms
graphalgorithms
+1
vote
2
answers
27
Travelling Salesman Problem
A)250 B)300 C)550 D)375
asked
Jan 5, 2017
in
Algorithms
by
Shradha
Junior
(
643
points)

1.1k
views
graphalgorithms
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
https://www.isro.gov.in/sites/default/files/comput...
Can someone please post official answer key link
I have raised objections for the (RPC, mutual...
cidacoder Because there are two questions in...
"What is the complexity of the following code?"...
50,737
questions
57,300
answers
198,291
comments
104,997
users