search
Log In

Recent questions tagged topological-sort

1 vote
1 answer
2
0 votes
0 answers
3
I want to know if there is topological sort for the syntax directed translations. Does LMD or Bottom up parsing have an order. Is there an order in which the result of SDT is calculated?
asked Dec 3, 2018 in Compiler Design ShruteeP 106 views
0 votes
1 answer
4
number of toplogical sort sequence
asked Nov 22, 2018 in DS amit166 305 views
1 vote
1 answer
5
0 votes
1 answer
6
If we apply Topological and DFS traversal. Is there any intersection of ordering? Please explain.
asked Aug 26, 2018 in Algorithms Rishav Kumar Singh 543 views
1 vote
0 answers
7
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.
asked Jul 4, 2018 in Algorithms Abhilash Mishra 163 views
0 votes
0 answers
8
What is the best data structure to implement topological sort on directed graph? The answer given is Queue. But we can implement it using dfs also, so why the best data structure is Queue and not Stack?
asked Jun 2, 2018 in DS Ayesha_S 84 views
3 votes
1 answer
9
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 topological ordering is 13. ... is 48. If I try to solve it by brute force method, then it's taking lot's of time. Is there any faster way?
asked Oct 21, 2017 in DS stanchion 431 views
0 votes
0 answers
10
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.
asked Feb 3, 2017 in Algorithms mohit chawla 1.1k views
0 votes
1 answer
11
How to solve these kinds of questions? (Any short or quick method will be appreciated)
asked Jan 30, 2017 in Algorithms The_Toad_Sage 311 views
1 vote
1 answer
12
asked Jan 30, 2017 in Programming AmitPatil 106 views
0 votes
1 answer
14
"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 solving some problems, and tried on several problems ... giving me a correct answer, please can anyone refer me to standard(reference) books about this!(I found that,too but failed)
asked Jan 17, 2017 in Databases smartmeet 428 views
1 vote
0 answers
15
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
asked Nov 23, 2016 in Algorithms 2018 114 views
2 votes
1 answer
16
How many topological sorts are possible for this graph?? // please explain how to solve this?
asked Jul 12, 2016 in Algorithms sh!va 821 views
2 votes
1 answer
17
How many topological sorts of the following directed graph are possible?
asked Jan 8, 2016 in Algorithms shivanisrivarshini 480 views
To see more, click for the full list of questions or popular tags.
...