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 graph-algorithms
5
votes
1
answer
1
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 41
Consider the following weighted graph, where the weight of every edge is written on the edge itself. What is the number of possible minimum spanning trees for the above graph?
GO Classes
asked
in
Algorithms
Jan 28
by
GO Classes
294
views
goclasses2024-mockgate-13
goclasses
numerical-answers
algorithms
graph-algorithms
minimum-spanning-tree
2-marks
0
votes
0
answers
2
how can it have back edges?
pcla
asked
in
Algorithms
Jan 28
by
pcla
68
views
algorithms
graph-algorithms
depth-first-search
3
votes
2
answers
3
MadeEasy Subject Test: Algorithms - Graph Algorithms
Consider vertices V1 and V2 that are simultaneously on function call stack at some point during DFS from vertex s. Which of the following are always true for this digraph ? 1. There exists a directed path from s to V1 and s to ... only statement 3 is correct......How can we say that statement 1 is also correct please someone explain the reason
Shivi rao
asked
in
Algorithms
Nov 1, 2017
by
Shivi rao
777
views
made-easy-test-series
algorithms
graph-algorithms
0
votes
1
answer
4
DFS: Practice Exercise
Q1. Consider the following DFS algorithm for cycle detection in a graph. DFS(G) for each vertex u Belongs G.V u.color = WHITE U.pi = NIL time = 0 for each vertex u Belongs G.V if u.color == WHITE DFS-VISIT(G , u) DFS-VISIT(G, u) time = ... DFS tree if we draw an edge from one leaf node to another leaf node then that edge is called cross edge. Is this statement is true ??
Shubhanshu
asked
in
Algorithms
Oct 28, 2017
by
Shubhanshu
535
views
algorithms
graph-algorithms
depth-first-search
1
vote
1
answer
5
union find
Is time complexity of union find algo on an undirected graph G with V vertices and E edges O(E) ?
A_i_$_h
asked
in
Algorithms
Oct 22, 2017
by
A_i_$_h
190
views
graph-algorithms
union-find
3
votes
0
answers
6
DFS: certain nodes not pushed to the stack.
Which of the following are true:- 1. DFS continues to visited first unvisited successor of each node as long as possible. 2. Certain nodes are pushed into the stack. 3. DFS first visits all the immediate successors of a node before moving to their ... nodes are pushed into the stack. 3. False -- this happens in BFS not in DFS. 4. True -- Iterative DFS.
Shubhanshu
asked
in
Algorithms
Oct 20, 2017
by
Shubhanshu
700
views
algorithms
depth-first-search
graph-algorithms
data-structures
1
vote
1
answer
7
Algo:- BFS
If in a given graph all edge weights are equal and negative then BFS will correctly find out single source shortest path to all vertices,starting from vertex v? True/False?
rahul sharma 5
asked
in
Algorithms
Oct 4, 2017
by
rahul sharma 5
635
views
algorithms
graph-algorithms
true-false
0
votes
0
answers
8
Depth first search
What is the correct answer please provide with reason?
saumya mishra
asked
in
Algorithms
Sep 25, 2017
by
saumya mishra
274
views
depth-first-search
data-structures
graph-algorithms
0
votes
0
answers
9
Floyd-warshall for longest path problem
I have few doubts related to Longest distance problem. From Wikipedia --> The NP-hardness 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/floyd-warshall-for-longest-distance-for-undirected-graph)
Chhotu
asked
in
Algorithms
Sep 8, 2017
by
Chhotu
2.4k
views
graph-algorithms
dynamic-programming
1
vote
1
answer
10
True/False?
The depth of any DFS (Depth First Search) tree rooted at a vertex is at least as much as the depth of any BFS tree rooted at the same vertex. I think in line graph has the same depth in both DFS and BFS. So it may be false.
dileswar sahu
asked
in
Algorithms
Sep 2, 2017
by
dileswar sahu
2.1k
views
algorithms
graph-algorithms
true-false
3
votes
2
answers
11
Graph_Traversal
Gate Ranker18
asked
in
DS
Aug 30, 2017
by
Gate Ranker18
621
views
graph-algorithms
depth-first-search
breadth-first-search
1
vote
1
answer
12
test series( how to solve these type of problems )
vipul verma
asked
in
Algorithms
Aug 25, 2017
by
vipul verma
460
views
minimum-spanning-tree
graph-algorithms
numerical-answers
made-easy-test-series
0
votes
1
answer
13
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??
Hira Thakur
asked
in
DS
Aug 22, 2017
by
Hira Thakur
549
views
graph-algorithms
0
votes
1
answer
14
CLRS 22.3.1
Make a 3-by-3 chart with row and column labels WHITE, GRAY, and BLACK. In each cell ( , ) ij , indicate whether, at any point during a depth-first search of a directed graph, there can be an edge from a vertex of color i to a vertex of color j . For each possible edge, indicate what types it can be.
sarika
asked
in
Algorithms
Aug 21, 2017
by
sarika
1.7k
views
depth-first-search
graph-algorithms
0
votes
1
answer
15
Please solve this Q with example
Question: 17 Consider two vertices a and b that are simultaneously on the FIFO queue at same point during the execution of breadth first search from s in an undirected graph. Which of the following is true? 1. The number of edges on the shortest path between ... less than the number of edges on the shortest path between s and b. 3. There is a path between a and b.
kallu singh
asked
in
Algorithms
Aug 20, 2017
by
kallu singh
611
views
graph-algorithms
shortest-path
0
votes
1
answer
16
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 ?
Xylene
asked
in
Programming in C
Aug 20, 2017
by
Xylene
2.4k
views
depth-first-search
algorithms
graph-algorithms
1
vote
0
answers
17
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.
bhuv
asked
in
Algorithms
Aug 5, 2017
by
bhuv
1.1k
views
graph-algorithms
prims-algorithm
algorithms
1
vote
1
answer
18
Discrete
Kuldeep Pal
asked
in
Algorithms
Jul 16, 2017
by
Kuldeep Pal
345
views
graph-algorithms
depth-first-search
graph-search
test-series
2
votes
1
answer
19
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(|V||E|) D. none of these
Abhisek Saha
asked
in
Algorithms
Jul 15, 2017
by
Abhisek Saha
530
views
graph-theory
graph-algorithms
1
vote
3
answers
20
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 ?
Abhisek Saha
asked
in
Algorithms
Jun 26, 2017
by
Abhisek Saha
1.1k
views
algorithms
graph-algorithms
shortest-path
0
votes
1
answer
21
Algorithm graph
Do the sum of forward edge,backward edges,and cross edges remains same in the graph??
RiteshSingh
asked
in
Algorithms
Jun 16, 2017
by
RiteshSingh
469
views
graph-algorithms
normal
3
votes
1
answer
22
Test by Bikram | Mock GATE | Test 4 | Question: 15
What is the worst case time complexity to calculate the depth of a directed acyclic graph (DAG) with ‘$V$’ vertices and ‘$E$’ edges? $O\left ( V+E \right )$ $O\left ( V \right )$ $O\left ( V^{2} +E \right )$ $O\left ( E\log V \right )$
Bikram
asked
in
Algorithms
May 14, 2017
by
Bikram
293
views
tbb-mockgate-4
algorithms
graph-algorithms
2
votes
1
answer
23
Test by Bikram | Mock GATE | Test 4 | Question: 8
Consider an unweighted undirected graph connected with $n$' vertices and $m$' edges. What is the worst case time complexity to check if two particular vertices $x$' and $y$' are present in graph; and, if present, how is the minimum distance between them calculated? ... $O\left ( n \right )$ $O\left ( n\log n \right )$ $O\left ( n+m \right )$
Bikram
asked
in
Algorithms
May 14, 2017
by
Bikram
1.1k
views
tbb-mockgate-4
algorithms
time-complexity
graph-algorithms
10
votes
8
answers
24
ISRO2017-17
Which of the following data structure is useful in traversing a given graph by breadth first search? Stack Queue List None of the above
Arjun
asked
in
Algorithms
May 10, 2017
by
Arjun
13.1k
views
isro2017
data-structures
graph-algorithms
breadth-first-search
easy
5
votes
3
answers
25
ISRO2017-76
Which of the following algorithms solves the all pair shortest path problem? Prim's algorithm Dijkstra's algorithm Bellman ford algorithm Floyd warshalls algorithm
sh!va
asked
in
Algorithms
May 7, 2017
by
sh!va
4.4k
views
isro2017
algorithms
graph-algorithms
2
votes
1
answer
26
#GRAPH_ALGORITHM
I want to know in which condition we should apply BFS and DFS for GRAPH Search ? And why?
Akashsaha
asked
in
Algorithms
May 5, 2017
by
Akashsaha
550
views
graph-algorithms
graph-search
2
votes
1
answer
27
Cormen
Given an adjacency-list representation of a directed graph, how long does it take to compute the out degree of every vertex? How long does it take to compute in-degrees?
Shubhanshu
asked
in
Algorithms
Apr 28, 2017
by
Shubhanshu
2.6k
views
graph-algorithms
time-complexity
1
vote
0
answers
28
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)
Akriti sood
asked
in
Algorithms
Mar 24, 2017
by
Akriti sood
1.8k
views
al
binary-tree
data-structures
graph-algorithms
0
votes
1
answer
29
ME Testseries
how many of the above statements are true?
Shubhanshu
asked
in
Algorithms
Mar 13, 2017
by
Shubhanshu
310
views
graph-algorithms
depth-first-search
numerical-answers
made-easy-test-series
Page:
1
2
3
4
5
6
7
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(24)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(682)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.6k
users
Recent questions tagged graph-algorithms
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation