Register

Search results for topological-sort

61 votes
5 answers
1
GATE CSE 2016 Set 1 | Question: 11
Consider the following directed graph: The number of different topological orderings of the vertices of the graph is _____________.
Consider the following directed graph:The number of different topological orderings of the vertices of the graph is _____________.
User Avatar
21 votes
7 answers
2
GATE CSE 2007 | Question: 5
Consider the DAG with $V = \{1,2,3,4,5,6\}$ shown below. Which of the following is not a topological ordering? $1$ $2$ $3$ $4$ $5$ $6$ $1$ $3$ $2$ $4$ $5$ $6$ $1$ $3$ $2$ $4$ $6$ $5$ $3$ $2$ $4$ $1$ $6$ $5$
Consider the DAG with $V = \{1,2,3,4,5,6\}$ shown below.Which of the following is not a topological ordering?$1$ $2$ $3$ $4$ $5$ $6$$1$ $3$ $2$ $4$ $5$ $6$$1$ $3$ $2$ $4$...
User Avatar
0 votes
1 answer
7
#selfdoubt
how many topological sort possible for above graph?directions like this question https://gateoverflow.in/39669/gate-cse-2016-set-1-question-11
how many topological sort possible for above graph?directions like this question https://gateoverflow.in/39669/gate-cse-2016-set-1-question-11
User Avatar
2 votes
0 answers
9
DRDO CSE 2022 Paper 1 | Question: 31
How many topological sortings (or topological orderings) does the given directed graph have?
How many topological sortings (or topological orderings) does the given directed graph have?
User Avatar
1 votes
1 answer
10
Cormen 3rd edition chapter 22 question: 22.4.4
Prove or disprove: If a directed graph G contains cycles, then TOPOLOGICAL SORT $(G)$ produces a vertex ordering that minimizes the number of “bad” edges that are inconsistent with the ordering produced.
Prove or disprove: If a directed graph G contains cycles, then TOPOLOGICAL SORT $(G)$ produces a vertex ordering that minimizes the number of “bad” edges that are inc...
User Avatar
0 votes
1 answer
11
Testbook Test Series
User Avatar
0 votes
2 answers
13
UGC NET CSE | October 2020 | Part 2 | Question: 70
Match $\text{list I}$ with $\text{List II}$ ... $\text{A-III, B-I, C-II, D-IV}$ $\text{A-I, B-III, C-II, D-IV}$
Match $\text{list I}$ with $\text{List II}$$\begin{array}{llll} & \text{List I} && \text{List II} \\ (A) & \text{Topological sort of DAG} & (I) & O(V+E) \\ (B) & \text{Kr...
User Avatar
0 votes
1 answer
15
UGC NET CSE | December 2005 | Part 2 | Question: 23
Consider the graph, which of the following is a valid topological sorting? $\text{ABCD}$ $\text{BACD}$ $\text{BADC}$ $\text{ABDC}$
Consider the graph, which of the following is a valid topological sorting?$\text{ABCD}$$\text{BACD}$$\text{BADC}$$\text{ABDC}$
User Avatar
0 votes
1 answer
17
toplogical sort
none
none
User Avatar
9 votes
4 answers
18
Topological Sort
How many Topological Orderings possible from A to H?
How many Topological Orderings possible from A to H?
User Avatar
2 votes
1 answer
19
#topological
number of toplogical sort sequence
number of toplogical sort sequence
User Avatar
0 votes
0 answers
20
UPPCL AE 2018:56
The Adjacency matrix of a directed graph $\text{G}$ ... $(h, c, a, e, f, d, i, g, b)$ $(c, a, d, e, f, g, h, i, b)$
The Adjacency matrix of a directed graph $\text{G}$ is given below.$\begin{array} {} & a & b & c & d & e & f & g & h & i \\ a & 0 & 1 & 0 & 0 & 0 & 0 & 1 & 0 & 0 \\ b & ...
User Avatar
Page: