Recent questions tagged graph-algorithms

+1 vote

1 answer

1

#Algortihms Gate 2000 Question Self Doubt
Source - Here Let G be an undirected graph. Consider a depth-first traversal of G, and let T be the resulting depth-first search tree. Let u be a vertex in G and let v be the first new (unvisited) vertex visited after visiting u in ... being, since (u,v) is an edge in G therefore they can only be SIBLINGS in DFS tree and never have descendant relationship?

asked May 29, 2018 in Algorithms by iarnav Loyal (8.3k points) | 120 views

+3 votes

1 answer

2

#Algorithms #DFS
Consider the tree arcs of a $DFS$ traversal from a source node $W$ in an unweighted, connected, undirected graph. The tree $T$ formed by the tree arcs is a data structure for computing the shortest path between every pair of vertices. the shortest path from $W$ ... in the graph. the shortest paths from $W$ to only those nodes that are leaves of $T$. the longest path in the graph.

asked May 28, 2018 in Algorithms by iarnav Loyal (8.3k points) | 211 views

+3 votes

1 answer

3

#Algorithms Gate 2005 Question Self Doubt.
Source of the question - here A sink in a directed graph is a vertex i such that there is an edge from every vertex $j ≠ i $ to i and there is no edge from i to any other vertex. A directed graph G with n vertices is represented by ... the diagonal elements in adjacency matrix is = 0. You can take a Graph with 4 vertices and make anyone of them as a sink.

asked May 23, 2018 in Algorithms by iarnav Loyal (8.3k points) | 292 views

0 votes

0 answers

4

Gate 2003 Graph-Algorithms Question Doubt.
You can refer this question here - https://gateoverflow.in/957/gate2003-70. I have tried so much to understand this question, but I'm not getting it, how to take the sample graph and also, how to consider the options! In fact, options are ... valid explanation at all. So, anyone help me get this in a simple layman terms, I'll be very much thankful to them.

asked May 18, 2018 in Algorithms by iarnav Loyal (8.3k points) | 79 views

0 votes

2 answers

5

#Algorithm Bellman Ford uses which algorithm design technique
Is it Dynamic programming?

asked May 17, 2018 in Algorithms by iarnav Loyal (8.3k points) | 254 views

0 votes

0 answers

6

#Algorithms #DFS How to find if a directed graph G is strongly connected using DFS in one pass?

asked May 13, 2018 in Algorithms by iarnav Loyal (8.3k points) | 108 views

0 votes

1 answer

7

DFS Traversal
If DFS algorithm applied starting from vertex A' which uses stack data structure then the height of stack is needed in worst case for DFS traversal is ________? Soln. Its a simple piece of cake we just need to find that path which leads to maximum nodes ... 0 and when to start counting with 1 because such type of ambiguous question always let my question go wrong and its painful :(

asked May 6, 2018 in Algorithms by Na462 Loyal (6.9k points) | 145 views

+2 votes

1 answer

8

Minimum Spanning Tree
1) Kruskal Algorithm 2) Prims Algorithm 3) Dijkstra Algorithm 4) Bellman Ford Algorithm 5) Floyd Warshall Algorithm Among these which one works for only i) Positive edge weight ii) Negative edge weight iii) Negative weight cycle

asked Apr 30, 2018 in Algorithms by srestha Veteran (117k points) | 311 views

0 votes

3 answers

9

#Algorithms #MST Doubt in MST Questions.
Question 1) The shortest-path tree computed by Dijkstra's algorithm is necessarily an MST? Question2 ) Prim's algorithm works with negative weighted edges?

asked Apr 29, 2018 in Algorithms by iarnav Loyal (8.3k points) | 144 views

+1 vote

1 answer

10

Self doubt
Is this statement correct?? and why? .If there are negative weight cycles than dijkstra will surely fail but if there are negative weight edges(need not be cycle) then dijkstra may or may not fail.

asked Apr 24, 2018 in Algorithms by Sandy Sharma Active (1.2k points) | 115 views

0 votes

1 answer

11

#Algorithms How is this equivalent in Kruskal's Algorithm's Time Complexity?
Kruskal Time complexity is O(mlogm) then how in upper bound it can be written as - O(m2) ----> How logm = O(m) and O (mn) ---------> How logn = O(n)

asked Apr 21, 2018 in Algorithms by iarnav Loyal (8.3k points) | 98 views

0 votes

0 answers

12

#Algorithms How many cuts are possible are in a graph with n nodes?
Some say answer is 2n and someplace else it's been told 2n-1-1. So, what's the corrent one?

asked Apr 19, 2018 in Algorithms by iarnav Loyal (8.3k points) | 92 views

0 votes

0 answers

13

Implementing Graph Data structure in C++
//Just check create_graph function. #include <iostream> #include <malloc.h> using namespace std; struct Adj_node { int node; struct Adj_node *next; }; typedef struct Adj_node Adj_node; struct Edge { int src, dest; }; typedef struct Edge Edge; ... endl; cin>>e; create_graph(v, e); print_adj_list(); return 0; } How to get rid of this problem?

asked Apr 8, 2018 in Programming by Jason Active (1.5k points) | 100 views

0 votes

0 answers

14

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 all-pairs shortest-paths problem on an input adjacency matrix, we need to compute not only the shortest-path weights but also a predecessor ... isnt both things (shortest-paths tree with root $i$ and predecessor subgraph of $G$ for $i$) the same?

asked Mar 24, 2018 in Programming by GateAspirant999 Active (2.5k points) | 70 views

0 votes

0 answers

15

DFS Modification
How DFS(Depth First Search) modification is used to find whether a graph is planar or not ?

asked Mar 21, 2018 in Algorithms by ankitgupta.1729 Boss (16.4k points) | 253 views

+1 vote

2 answers

16

Minimum Spanning Tree Problem

asked Mar 19, 2018 in Algorithms by pankaj_vir Boss (10.6k points) | 239 views

+1 vote

0 answers

17

Minimum Spanning Tree Problem
Given a graph with positive and distinct edge weights. If I double or triple.. the edge weights then:- 1. Shortest path will remain same 2. Mst will remain same Right? Note : Here i am doubling or tripling or four times ..... not increasing by +c

asked Feb 19, 2018 in Algorithms by Na462 Loyal (6.9k points) | 235 views

0 votes

0 answers

18

DFS-Algorithm
Let T be a depth first search tree in an undirected graph G. Vertices u and ν are leaves of this tree T. The degrees of both u and ν in G are at least 2. In such case in the graph there will be two cycles :- One Cycle will contain u and other one v. There cannot be a graph containig a single cycle and containing both u and v and also satisfy above Constraint. Am I right?

asked Feb 18, 2018 in Algorithms by Na462 Loyal (6.9k points) | 178 views

+17 votes

6 answers

19

GATE2018-47
Consider the following undirected graph $G$: Choose a value for $x$ that will maximize the number of minimum weight spanning trees (MWSTs) of $G$. The number of MWSTs of $G$ for this value of $x$ is ____.

asked Feb 14, 2018 in Algorithms by gatecse Boss (16.8k points) | 4.5k views

+30 votes

3 answers

20

GATE2018-43
Let $G$ be a graph with 100! vertices, with each vertex labelled by a distinct permutation of the numbers $1, 2,\ldots, 100.$ There is an edge between vertices $u$ and $v$ if and only if the label of $u$ can be obtained by swapping two adjacent numbers in the label ... $G$, and $z$ denote the number of connected components in $G$. Then, $y+10z$ = ____

asked Feb 14, 2018 in Algorithms by gatecse Boss (16.8k points) | 5.3k views

+2 votes

3 answers

21

Ace Test Series: Graph Theory - Number Of Spanning Trees
How to approach such questions ? Please provide detailed solution. Answer given is option C

asked Feb 2, 2018 in Graph Theory by kapilbk1996 (403 points) | 840 views

+6 votes

1 answer

22

Back edge,tree edge,forward edges in BFS
Consider the following statements: 1. Let T be the DFS tree resulting from DFS traversal on a connected directed graph the root of the tree is an articulation point, iff it has at least two children. 2. When BFS is carried out on a directed ... back edge, or cross edge and not forward edge as in the case of DFS. Find TRUE or FALSE for both the statements

asked Jan 27, 2018 in DS by MIRIYALA JEEVAN KUMA Active (2.4k points) | 1.8k views

+5 votes

2 answers

23

True/False
Which of the following statements related to graphs are True? Minimum Spanning Tree has ALWAYS Minimum weight edge included in it. Minimum Spanning Tree MIGHT have Maximum weight edge weight included in it. Maximum Spanning Tree has ALWAYS Maximum weight edge included ... edge included in it. Longest path from source to destination MAY OR MAY NOT have Maximum weight edge included in it.

asked Jan 27, 2018 in Graph Theory by Balaji Jegan Active (4.9k points) | 209 views

+2 votes

0 answers

24

DFS- depth first search

asked Jan 25, 2018 in DS by budhu (139 points) | 110 views

+1 vote

1 answer

25

BFS- No of Teversals
How to solve these kind of questions?

asked Jan 17, 2018 in DS by Shubham Kumar Gupta (449 points) | 149 views

+1 vote

0 answers

26

MadeEasy Test Series 2018: Algorithms - Graph Algorithms
Can someone work this out?

asked Jan 16, 2018 in Algorithms by Kalpataru Bose (401 points) | 131 views

+2 votes

1 answer

27

MadeEasy Test Series 2018: Algorithms - Graph Algorithms
Consider the following graph and sequences given below : Given answer for no of DFS traversal was 2 : S1 and S2. How S2 is a DFS traversal ?

asked Jan 12, 2018 in Algorithms by sumit chakraborty Active (1.1k points) | 79 views

+2 votes

0 answers

28

NO Of BFS traversal
what is the question asking exactly?

asked Jan 11, 2018 in Programming by gari Active (3.5k points) | 148 views

+5 votes

0 answers

29

minimum spanning tree

asked Jan 10, 2018 in DS by Lakshman Patel RJIT Veteran (54.8k points) | 105 views

+2 votes

0 answers

30

MadeEasy Test Series 2018: Algorithms - Graph Algorithms
For a directed graph, the absence of back edges in a DFS tree can have cycle. true or fale.please explain with an example.

asked Jan 10, 2018 in Algorithms by jaig (315 points) | 85 views

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 questions tagged graph-algorithms

Recent Posts

Recent Blog Comments