Topological sorting in Data Structures Theory - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is topological sorting?

Topological sorting is a way to arrange the nodes of a directed graph in a linear order so that for every directed edge from node A to node B, A comes before B in the order.

beginner

Which type of graph can have a topological sort?

Only directed acyclic graphs (DAGs) can have a topological sort because cycles would make it impossible to order nodes without conflicts.

intermediate

Why can't graphs with cycles be topologically sorted?

Because in a cycle, nodes depend on each other in a loop, so there is no way to order them linearly without breaking the dependency.

intermediate

Name two common algorithms used for topological sorting.

The two common algorithms are Kahn's algorithm and Depth-First Search (DFS) based algorithm.

beginner

Give a real-life example where topological sorting is useful.

Topological sorting is useful in scheduling tasks where some tasks must be done before others, like building a house where the foundation must be done before walls.

Which graph property is required for topological sorting?

A The graph must be complete

B The graph must be undirected

C The graph must contain cycles

D The graph must be directed and acyclic

Topological sorting only works on directed acyclic graphs (DAGs).

What does a topological sort of a graph represent?

A A shortest path between two nodes

B A random order of nodes

C A linear order of nodes respecting dependencies

D A cycle detection method

It arranges nodes so that all dependencies come before dependent nodes.

Which algorithm is NOT used for topological sorting?

A Dijkstra's algorithm

B Kahn's algorithm

C Depth-First Search (DFS)

D None of the above

Dijkstra's algorithm is for shortest paths, not topological sorting.

What happens if you try to topologically sort a graph with a cycle?

A It is impossible to find a valid order

B The cycle is ignored

C The graph becomes undirected

D The sorting completes normally

Cycles prevent a linear ordering that respects dependencies.

In a task scheduling scenario, what does topological sorting help with?

A Ignoring task dependencies

B Ordering tasks so prerequisites come first

C Randomizing task order

D Finding the longest task

It ensures tasks are done only after their prerequisites.

Explain what topological sorting is and why it requires a directed acyclic graph.

Think about ordering tasks with dependencies and why loops cause problems.

Describe two algorithms used for topological sorting and how they generally work.

One uses removing nodes step-by-step, the other uses depth-first search.

Practice

1. What is the main requirement for a graph to have a valid topological sorting?

easy

A. The graph must be a Directed Acyclic Graph (DAG)

B. The graph must be undirected

C. The graph must contain cycles

D. The graph must be complete

Solution

1. Step 1: Understand the definition of topological sorting

   Topological sorting orders nodes so that every directed edge from node A to node B means A comes before B in the order.

2. Step 2: Identify the graph type needed

   This ordering is only possible if the graph has no cycles, meaning it must be a Directed Acyclic Graph (DAG).

3. Final Answer:

   The graph must be a Directed Acyclic Graph (DAG) -> Option A

4. Quick Check:

   DAG = Required for topological sorting [OK]

Hint: Topological sort needs no cycles, so graph must be DAG [OK]

Common Mistakes:

• Thinking topological sort works on undirected graphs
• Assuming cycles are allowed
• Confusing DAG with any directed graph

2. Which of the following is the correct way to represent the order of nodes after a topological sort?

easy

A. A list where each node appears before all nodes it points to

B. A list where nodes appear in random order

C. A list where each node appears after all nodes it points to

D. A list sorted by node values numerically

Solution

1. Step 1: Recall the property of topological order

   In topological sorting, every node appears before all nodes it has edges to (its dependencies come first).

2. Step 2: Match this property to the options

   A list where each node appears before all nodes it points to correctly states that each node appears before all nodes it points to, which is the definition of topological order.

3. Final Answer:

   A list where each node appears before all nodes it points to -> Option A

4. Quick Check:

   Node order respects edges direction = A list where each node appears before all nodes it points to [OK]

Hint: Topological order means dependencies come first [OK]

Common Mistakes:

• Confusing order with numerical sorting
• Thinking nodes appear after their dependencies
• Assuming random order is valid

3. Given the directed edges: A -> B, B -> C, and A -> C, which of the following is a valid topological order?

medium

A. [C, A, B]

B. [B, A, C]

C. [C, B, A]

D. [A, B, C]

Solution

1. Step 1: Analyze the edges and dependencies

   Node A points to B and C, so A must come before B and C. Node B points to C, so B must come before C.

2. Step 2: Check each option against these rules

   [A, B, C] respects A before B and C, and B before C. The other options violate these dependencies.

3. Final Answer:

   [A, B, C] -> Option D

4. Quick Check:

   Order respects edges = [A, B, C] [OK]

Hint: Place nodes before their dependents in order [OK]

Common Mistakes:

• Ignoring edge directions
• Placing dependent nodes before their prerequisites
• Choosing reverse order

4. Consider the following graph edges: 1 -> 2, 2 -> 3, 3 -> 1. What is the problem when trying to perform topological sorting on this graph?

medium

A. The graph has too many nodes

B. The graph is disconnected

C. The graph contains a cycle, so topological sorting is impossible

D. The graph is undirected

Solution

1. Step 1: Identify the cycle in the graph

   The edges form a cycle: 1 -> 2 -> 3 -> 1, which means the graph is not acyclic.

2. Step 2: Understand topological sorting requirements

   Topological sorting requires the graph to be acyclic. A cycle makes it impossible to order nodes without violating dependencies.

3. Final Answer:

   The graph contains a cycle, so topological sorting is impossible -> Option C

4. Quick Check:

   Cycle present = no topological sort [OK]

Hint: Cycles block topological sorting; check for cycles first [OK]

Common Mistakes:

• Ignoring cycles and trying to sort anyway
• Confusing disconnected graphs with cycles
• Assuming undirected graphs can be topologically sorted

5. You have tasks with dependencies: Task 1 before Task 3, Task 2 before Task 3, and Task 3 before Task 4. Which of the following is a valid topological order for these tasks?

hard

A. [3, 1, 2, 4]

B. [1, 2, 3, 4]

C. [4, 3, 2, 1]

D. [2, 1, 4, 3]

Solution

1. Step 1: List the dependencies clearly

   Task 1 and Task 2 must come before Task 3, and Task 3 must come before Task 4.

2. Step 2: Validate each option against dependencies

   [1, 2, 3, 4] respects all dependencies. The other options violate at least one dependency.

3. Final Answer:

   [1, 2, 3, 4] -> Option B

4. Quick Check:

   Order respects all dependencies = [1, 2, 3, 4] [OK]

Hint: Place all prerequisites before dependent tasks [OK]

Common Mistakes:

• Placing dependent tasks before prerequisites
• Ignoring order of multiple dependencies
• Assuming any order is valid