Cycles · Acyclic Graphs
Lesson 9
For the curious 🤓
Like trees, acyclic graphs form an important class. Like in trees, some algorithmic problems are easier to solve in acyclic graphs than in the general case. For example, finding the longest (simple) path in an acyclic graph can be done in linear time, whereas in the general case, we only know algorithms with exponential running time.