Hungarian Algorithm Visual Debugger

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

hungarian.mov

Interactive Raylib debugger for the Hungarian algorithm, showing row/column reductions, zero structure, line covers, augmenting choices, and the emergence of the final minimum-cost assignment.

What This Visualisation Shows

• How the cost matrix is normalized with row and column reductions
• How zero locations encode assignment opportunities
• How covers and adjustments expose new zeros when the current cover is insufficient
• A step-through layout for understanding the full assignment pipeline

Visual Map

flowchart LR
    A["Cost Matrix"]
    B["Row / Column Reduction"]
    C["Zero Structure"]
    D["Cover Zeros"]
    E["Adjust Uncovered Entries"]
    F["Optimal Assignment"]

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

Loading

Controls

• q: quit
• space: auto or pause
• enter: single step
• r: reset fixed matrix
• n: random matrix
• h: help
• g: goal view

Run

make run