Identify the correct concept described as: an ordering of vertices in a directed acyclic graph such that for every edge, the source vertex comes before the destination vertex.
- A. Memoization
- B. Selection sort
- C. Topological sort ✓
- D. Bellman-Ford algorithm
Correct answer
C. Topological sort
Explanation
Topological sort refers to an ordering of vertices in a directed acyclic graph such that for every edge, the source vertex comes before the destination vertex.