Data structures and algorithms
A dependency graph has edges a → b, a → c, b → d, c → d.
FoundationNumeric answer
A dependency graph has edges , , , . How many valid topological orderings are there?
Answer with a number. Fractions, powers and expressions like 23/6 or C(52,5) are read correctly in practice.
The worked solution is in Premium
The answer, the full working and the one idea to take away – for this and all 1,322 questions in the bank. Answer it in practice and your working is marked, with a known mistake named when you make one.
Report an issue with this question
Learn the method
Of the kind reported at
More data structures and algorithms questions
- A graph has edges A–B (weight 1), B–C (2), A–C (3), C–D (4) and B–D (5).Applied · Premium
- Converting between currencies, part 2 of 3Applied · Premium
- With both union by rank and path compression, what is the amortised cost of a…Advanced · Premium
- Converting between currencies, part 3 of 3Expert · Premium
- What is the maximum number of edges in a directed acyclic graph on ten vertices?Foundation · Premium
- Converting between currencies, part 1 of 3Foundation · Premium