Discrete

Kuldeep Pal asked Jul 16, 2017 • retagged Jul 14, 2022 by makhdoom ghaya

359 views

1 votes

Algorithms
graph-algorithms
depth-first-search
graph-search
test-series

+ –

Kuldeep Pal asked Jul 16, 2017 • retagged Jul 14, 2022 by makhdoom ghaya

Kuldeep Pal

359 views

See all

1 1 comment

Kuldeep Pal

commented Jul 16, 2017

Please tell maximum and minimum both.

0 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 votes

Maximum should be 6 for the path 0 - 1 - 2 - 3 - 4 - 6 and minimum should be 4 for the path 0 - 2 - 5 - 7

just_bhavana answered Jul 16, 2017

just_bhavana

See all

1 1 comment

Psy Duck

commented Aug 7, 2022

Why cant be minimum depth be 0 when we have no elements in the stack

0 votes

Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

1 votes

4 answers

eyeamgj asked May 10, 2018

2,348 views

algorithm
In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/yx/y, where x is discovery time stamp and y is finishing time stamp It shows which of the following depth first forest? {a,b,e} {c,d,f,g,h} {a,b,e} {c,d,h} {f,g} {a,b,e} {f,g} {c,d} {h} {a,b,c,d} {e,f,g} {h}

In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/yx/y, where x is discovery time stamp and y is finishin...

eyeamgj

2.3k views

eyeamgj asked May 10, 2018

Algorithms
depth-first-search
graph-algorithms
graph-search

+ –

29 votes

8 answers

Ishrat Jahan asked Oct 31, 2014

11,205 views

GATE IT 2006 | Question: 47
Consider the depth-first-search of an undirected graph with $3$ vertices $P$, $Q$, and $R$. Let discovery time $d(u)$ represent the time instant when the vertex $u$ is first visited, and finish time $f(u)$ represent the time instant when the ... are two connected components, and $Q$ and $R$ are connected There are two connected components, and $P$ and $Q$ are connected

Consider the depth-first-search of an undirected graph with $3$ vertices $P$, $Q$, and $R$. Let discovery time $d(u)$ represent the time instant when the vertex $u$ is fi...

Ishrat Jahan

11.2k views

Ishrat Jahan asked Oct 31, 2014

Algorithms
gateit-2006
algorithms
graph-algorithms
normal
graph-search
depth-first-search

+ –

52 votes

11 answers

Ishrat Jahan asked Oct 29, 2014

13,749 views

GATE IT 2007 | Question: 24
A depth-first search is performed on a directed acyclic graph. Let $d[u]$ denote the time at which vertex $u$ is visited for the first time and $f[u]$ the time at which the DFS call to the vertex $u$ terminates. Which of the following statements is always TRUE for all edges $(u, v)$ in the graph ? $d[u] < d[v]$ $d[u] < f[v]$ $f[u] < f[v]$ $f[u] > f[v]$

A depth-first search is performed on a directed acyclic graph. Let $d[u]$ denote the time at which vertex $u$ is visited for the first time and $f[u]$ the time at which t...

Ishrat Jahan

13.7k views

Ishrat Jahan asked Oct 29, 2014

Algorithms
gateit-2007
algorithms
graph-algorithms
normal
graph-search
depth-first-search

+ –

23 votes

3 answers

Ishrat Jahan asked Oct 28, 2014

8,030 views

GATE IT 2008 | Question: 47
Consider the following sequence of nodes for the undirected graph given below: $a$ $b$ $e$ $f$ $d$ $g$ $c$ $a$ $b$ $e$ $f$ $c$ $g$ $d$ $a$ $d$ $g$ $e$ $b$ $c$ $f$ $a$ $d$ $b$ $c$ $g$ $e$ $f$ A Depth First Search (DFS) is started at ... first visited. Which of the above is/are possible output(s)? $1$ and $3$ only $2$ and $3$ only $2, 3$ and $4$ only $1, 2$ and $3$ only

Consider the following sequence of nodes for the undirected graph given below:$a$ $b$ $e$ $f$ $d$ $g$ $c$$a$ $b$ $e$ $f$ $c$ $g$ $d$$a$ $d$ $g$ $e$ $b$ $c$ $f$$a$ $d$ $b$...

Ishrat Jahan

8.0k views

Ishrat Jahan asked Oct 28, 2014

Algorithms
gateit-2008
algorithms
graph-algorithms
normal
graph-search
depth-first-search

+ –

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

1 1 comment reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

1 1 comment reply

Please log in or register to add a comment.

Related questions

1 1 comment

1 1 comment