Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged topological-sort
1
votes
1
answer
31
Madeasy 2k17
Caption
Caption
kamakshi
1.3k
views
kamakshi
asked
Nov 18, 2017
Algorithms
graph-algorithm
topological-sort
depth-first-search
made-easy-test-series
+
–
3
votes
1
answer
32
topological ordering of DAG
What is the method to find no of topological ordering of a Directed Acyclic Graph? For an instance, i found two graphs on internet, whose no of topological ordering is given but how to quickly calculate the total no of ordering? Graph 1 For graph 1, no of ... . If I try to solve it by brute force method, then it's taking lot's of time. Is there any faster way?
What is the method to find no of topological ordering of a Directed Acyclic Graph?For an instance, i found two graphs on internet, whose no of topological ordering is giv...
stanchion
957
views
stanchion
asked
Oct 21, 2017
DS
topological-sort
data-structures
directed-acyclic-graph
no-of-topological-ordering
+
–
0
votes
0
answers
33
Topological sorting
My ques. is not the no. of topological sort as i have computed it myself. My problem is can someone please telll me a efficient approach as tree method is taking a lot of time here, like by use of combinatorics, can we find it easily, i.e in less time. and if possible, pls provide general approach apart from tree method.
My ques. is not the no. of topological sort as i have computed it myself. My problem is can someone please telll me a efficient approach as tree method is taking a lot of...
mohit chawla
2.2k
views
mohit chawla
asked
Feb 3, 2017
Algorithms
topological-sort
made-easy-test-series
algorithms
+
–
3
votes
5
answers
34
MadeEasy CBT 2017: Algorithms - Graph Algorithms
No of topological sortings
No of topological sortings
Vasu_gate2017
2.0k
views
Vasu_gate2017
asked
Jan 22, 2017
Algorithms
made-easy-test-series
cbt-2017
algorithms
graph-algorithms
topological-sort
+
–
0
votes
1
answer
35
Number of possible conflict equivalent serial schedules
"Number of possible conflict equivalent serial schedules to some non-serial schedule is total number of topological sorts of its precedence graph." I haven't read this method anywhere yet but I found it by myself while ... answer, please can anyone refer me to standard(reference) books about this!(I found that,too but failed)
"Number of possible conflict equivalent serial schedules to some non-serial schedule is total number of topological sorts of its precedence graph."I haven't read this met...
smartmeet
1.0k
views
smartmeet
asked
Jan 17, 2017
Databases
topological-sort
databases
concurrency
conflict-serializable
algorithms
+
–
0
votes
1
answer
36
topological sort
how many topological sort possible for n vetex(except the null graph)???
how many topological sort possible for n vetex(except the null graph)???
Hira Thakur
690
views
Hira Thakur
asked
Nov 29, 2016
Algorithms
algorithms
topological-sort
normal
+
–
1
votes
0
answers
37
MIT QUIZs 2009
Topological sort can be performed using one breadth-first search procedure on the graph?? ans) False. why? as both are DFS and BFS can do it in O(v+e) time
Topological sort can be performed using one breadth-first search procedure on the graph??ans) False. why? as both are DFS and BFS can do it in O(v+e) time
2018
424
views
2018
asked
Nov 23, 2016
Algorithms
topological-sort
+
–
2
votes
1
answer
38
Algo-Topological Sort
KISHALAY DAS
1.8k
views
KISHALAY DAS
asked
Nov 14, 2016
Algorithms
topological-sort
test-series
+
–
3
votes
0
answers
39
topological sort
Pls find the answer and verify ???? 1)14 as 9!/3!3!3! 2) 36 as 3!*3! 3)216 as 3!*3!*3!
Pls find the answer and verify ????1)14 as 9!/3!3!3!2) 36 as 3!*3!3)216 as 3!*3!*3!
Amit puri
801
views
Amit puri
asked
Aug 3, 2016
Algorithms
algorithms
topological-sort
descriptive
+
–
61
votes
5
answers
40
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 _____________.
Sandeep Singh
28.3k
views
Sandeep Singh
asked
Feb 12, 2016
Algorithms
gatecse-2016-set1
algorithms
graph-algorithm
normal
numerical-answers
topological-sort
+
–
2
votes
2
answers
41
Topology
How many topological sorts of the following directed graph are possible?
How many topological sorts of the following directed graph are possible?
shivanisrivarshini
1.3k
views
shivanisrivarshini
asked
Jan 7, 2016
Algorithms
topological-sort
virtual-gate-test-series
+
–
21
votes
7
answers
42
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$...
pC
7.8k
views
pC
asked
Dec 21, 2015
Algorithms
gatecse-2007
algorithms
graph-algorithm
topological-sort
easy
+
–
0
votes
2
answers
43
What is the difference between Topological sort and bellman-ford Algorithm ?
A) Do following for every vertex u in topological order. ..Do following for every adjacent vertex v of u if (dist[v] > dist[u] + weight(u, v)) dist[v] = dist[u] + weight(u, v ... following similar steps , so then why is the time complexity of bellman-ford O(VE) while for toplogical sort it is O(V+E) ?
A) Do following for every vertex u in topological order.………..Do following for every adjacent vertex v of u………………if (dist[v] dist[u] + weight(u, v))…�...
radha gogia
1.3k
views
radha gogia
asked
Jul 5, 2015
Algorithms
topological-sort
bellman-ford
time-complexity
+
–
0
votes
1
answer
44
What is the maximum number of topological sorting possible ?
For a given set of vertices , can we compute the maximum number of topological sortings possible ?
For a given set of vertices , can we compute the maximum number of topological sortings possible ?
radha gogia
1.3k
views
radha gogia
asked
Jun 30, 2015
Algorithms
algorithms
topological-sort
normal
+
–
31
votes
5
answers
45
GATE CSE 2014 Set 1 | Question: 13
Consider the directed graph below given. Which one of the following is TRUE? The graph does not have any topological ordering. Both PQRS and SRQP are topological orderings. Both PSRQ and SPRQ are topological orderings. PSRQ is the only topological ordering.
Consider the directed graph below given. Which one of the following is TRUE?The graph does not have any topological ordering.Both PQRS and SRQP are topological orderings....
go_editor
7.6k
views
go_editor
asked
Sep 26, 2014
Algorithms
gatecse-2014-set1
graph-algorithm
easy
topological-sort
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register