This visualisation uses AI Generated code, finetuned for the best visualisation, not code quality

Interactive C + Raylib debugger for minimum spanning trees, comparing Kruskal and Prim while exposing candidate edges, cycle tests, frontier growth, and total-cost evolution.

• How Kruskal grows an MST by sorting edges and rejecting cycles
• How Prim grows an MST from one seed vertex via frontier relaxation
• How DSU state, frontier state, and code-level phases evolve step by step
• How presets and runtime controls change graph density and decision order

flowchart LR
    A["Weighted Graph"]
    B["Choose Kruskal or Prim"]
    C["Candidate Edge / Frontier"]
    D["Cycle Test or Relaxation"]
    E["Accept Edge Into MST"]
    F["Updated Total Cost"]

    A --> B
    B --> C
    C --> D
    D --> E
    E --> F

• q: quit
• h: toggle help
• The play, step, reset, preset, and runtime controls are available in the top UI

make run