# mru-exe/kruskalxprim architecture

> Architecture diagram of the GitHub repository mru-exe/kruskalxprim, generated by GitDiagram from its file tree, README and a sample of source files (last updated 2025-10-27). It is an AI-made overview: check details against the source.

- Interactive diagram: https://gitdiagram.com/mru-exe/kruskalxprim
- Repository: https://github.com/mru-exe/kruskalxprim

## Overview

##### Project Type and Purpose
- This is a small C++ command-line tool for comparing two minimum spanning tree (MST) algorithms: Kruskal’s and Prim’s.
- It consists of: a build system (CMake), a single header/module defining a graph abstraction and both algorithms (`graph.hpp`), and an executable entry point (`main.cpp`).

##### Key Components
a. Build System
- CMakeLists.txt – orchestrates compilation of `main.cpp` and inclusion of `graph.hpp`.
b. Graph Module
- graph.hpp – defines:
– Graph data structures (nodes, edges, adjacency lists/matrix).
– Kruskal’s algorithm implementation (likely using Union-Find).
– Prim’s algorithm implementation (likely using a priority queue).
c. CLI Executable
- main.cpp – parses input (e.g., reads a graph), invokes both algorithms, collects timing/weight results, and outputs a comparison.

##### Relationships and Data Flows
1. Build System → compiles → Graph Module + Main.
2. CLI Executable (main) → instantiates → Graph data structures.
3. main → calls → Kruskal(graph) and Prim(graph).
4. Each algorithm → reads/writes → Graph internals (edges, vertex sets).
5. main → displays → MST results (total weight, runtime metrics).

##### Architectural Patterns and Design Principles
- Single‐File Abstraction: `graph.hpp` encapsulates both data structures and algorithm logic.
- Layered Flow: CLI layer (main) → Algorithm layer (graph.hpp) → Data layer (graph internals).
- Reuse of STL: priority_queue, vector, sort, union‐find patterns.

##### Checklist for Detail
- Every module clearly named.
- Data structures vs. algorithmic components visually distinct.
- Build step separated from run‐time flow.
- Optional: annotate algorithmic complexity or key data structures (e.g., Union-Find, Priority Queue).

## Diagram (Mermaid)

```mermaid
flowchart TD
    subgraph "Build Phase"
        Build["Build System (CMake)"]:::build
        GraphEngine["Graph Engine (graph.hpp)"]:::engine
        CLI["CLI Executable (main.cpp)"]:::cli
        Build -->|"compiles"| GraphEngine
        Build -->|"compiles"| CLI
    end

    subgraph "Run-time Flow"
        Main["CLI Executable (Runtime)"]:::cli
        GraphInstance["Graph Instance"]:::ds
        Kruskal["Kruskal Module"]:::algK
        Prim["Prim Module"]:::algP
        DataStruct["Graph Data Structures"]:::ds
        Console["User Interface (Console)"]:::ui

        Main -->|"creates"| GraphInstance
        Main -->|"invokes"| Kruskal
        Main -->|"invokes"| Prim
        Kruskal -->|"operate on"| DataStruct
        Prim -->|"operate on"| DataStruct
        Main -->|"outputs"| Console
    end

    click Build "https://github.com/mru-exe/kruskalxprim/blob/master/CMakeLists.txt"
    click GraphEngine "https://github.com/mru-exe/kruskalxprim/blob/master/graph.hpp"
    click CLI "https://github.com/mru-exe/kruskalxprim/blob/master/main.cpp"

    classDef build fill:#eeeeee,stroke:#333,stroke-width:1px
    classDef cli fill:#ffcc99,stroke:#333,stroke-width:1px
    classDef engine fill:#cce5ff,stroke:#333,stroke-width:1px
    classDef algK fill:#3399ff,stroke:#333,stroke-width:1px
    classDef algP fill:#99ff99,stroke:#333,stroke-width:1px
    classDef ds fill:#ffffcc,stroke:#333,stroke-width:1px
    classDef ui fill:#ffcccc,stroke:#333,stroke-width:1px
```
