Kruskal's Algorithm – for computing a Minimum Spanning Tree (MST). DFS with Topological Sort and Cycle Detection – for analyzing directed graphs. . ├── inputs/ → Graph input files (auto-generated) ├── ...

A benchmarking toolkit for comparing Kruskal's and Prim's minimum spanning tree algorithms across various graph configurations, with visualization tools and performance analysis reports.

The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings, Eulerian and Hamiltonian cycles, and ...