Graph Theory

Graph Theory

Decreasing Graph Complexity with Transitive Reductions

Graphs can contain a lot of unnecessary edges that make computations a lot more demanding. It is also harder to reason about the dependency structure of a graph with a lot of edges. In the last guide, I implemented topological sorting and gave a basic introduction into what directed acyclic

Graph Theory

Scheduling Tasks with Topological Sorting

Imagine you want to bake a cake: There are multiple tasks you need to follow to end up with the final dish, from gathering and preparing ingredients over setting up the oven to finally baking it. Most, if not all, tasks depend on the completion of their predecessor. To represent