Data Structure Lecture Note (Week 5, Lecture 14)

Directed Graph A directed graph G = (V, E) is a graph such that E is not necessarily symmetric. Topological Sorting We want to figure out an ordering < of vertices such that: If A < B, then A can reac

>>阅读原文<<