# jlcorcuera/pucp-adv-alg-2026-01 architecture

> Architecture diagram of the GitHub repository jlcorcuera/pucp-adv-alg-2026-01, generated by GitDiagram from its file tree, README and a sample of source files (last updated 2026-10-02). It is an AI-made overview: check details against the source.

- Interactive diagram: https://gitdiagram.com/jlcorcuera/pucp-adv-alg-2026-01
- Repository: https://github.com/jlcorcuera/pucp-adv-alg-2026-01

## Overview

This is a course-exercise repository, not a single integrated application. The principal workflow is for a student to choose a chapter’s standalone C++ examples, compile and run an exercise, and examine its result. The graph preserves the five documented algorithm topics and the supplementary STL notes. Chapter nodes represent their exercise directories, including files not individually sampled; evolutionary algorithms are documented as a topic, but no implementation file appears in the tree. Relationships are limited to the workflow documented in the README.

Main entry points: [`cap-01-backtracking`](https://github.com/jlcorcuera/pucp-adv-alg-2026-01/tree/main/cap-01-backtracking) (Backtracking Exercises), [`cap-02-dynamic-programming`](https://github.com/jlcorcuera/pucp-adv-alg-2026-01/tree/main/cap-02-dynamic-programming) (DP Exercises), [`cap-03-heuristics`](https://github.com/jlcorcuera/pucp-adv-alg-2026-01/tree/main/cap-03-heuristics) (Greedy Exercises), [`cap-04-metaheuristics`](https://github.com/jlcorcuera/pucp-adv-alg-2026-01/tree/main/cap-04-metaheuristics) (GRASP Exercises)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_backtracking["Backtracking"]
  node_backtracking_examples["Backtracking Exercises"]
end

subgraph group_dynamic["Dynamic Programming"]
  node_dp_examples["DP Exercises"]
end

subgraph group_heuristics["Greedy Heuristics"]
  node_greedy_examples["Greedy Exercises"]
end

subgraph group_metaheuristics["GRASP Metaheuristics"]
  node_grasp_examples["GRASP Exercises"]
end

subgraph group_evolutionary["Evolutionary Algorithms"]
  node_evolutionary_topic["Evolutionary Topic"]
end

subgraph group_notes["STL Notes"]
  node_vector_notes["Vector Notes"]
  node_map_notes["Map Notes"]
end

node_student(("Student"))

node_student -->|"selects exercises"| node_backtracking_examples
node_student -->|"selects exercises"| node_dp_examples
node_student -->|"selects exercises"| node_greedy_examples
node_student -->|"selects exercises"| node_grasp_examples
node_student -->|"studies topic"| node_evolutionary_topic
node_student -->|"reads notes"| node_vector_notes
node_student -->|"reads notes"| node_map_notes

click node_backtracking_examples "https://github.com/jlcorcuera/pucp-adv-alg-2026-01/tree/main/cap-01-backtracking"
click node_dp_examples "https://github.com/jlcorcuera/pucp-adv-alg-2026-01/tree/main/cap-02-dynamic-programming"
click node_greedy_examples "https://github.com/jlcorcuera/pucp-adv-alg-2026-01/tree/main/cap-03-heuristics"
click node_grasp_examples "https://github.com/jlcorcuera/pucp-adv-alg-2026-01/tree/main/cap-04-metaheuristics"
click node_evolutionary_topic "https://github.com/jlcorcuera/pucp-adv-alg-2026-01/tree/main/cap-05-evolutionary-algorithms"
click node_vector_notes "https://github.com/jlcorcuera/pucp-adv-alg-2026-01/tree/main/add-notes-01-vector"
click node_map_notes "https://github.com/jlcorcuera/pucp-adv-alg-2026-01/tree/main/add-notes-02-map"

classDef toneNeutral fill:#f8fafc,stroke:#334155,stroke-width:1.5px,color:#0f172a
classDef toneBlue fill:#dbeafe,stroke:#2563eb,stroke-width:1.5px,color:#172554
classDef toneAmber fill:#fef3c7,stroke:#d97706,stroke-width:1.5px,color:#78350f
classDef toneMint fill:#dcfce7,stroke:#16a34a,stroke-width:1.5px,color:#14532d
classDef toneRose fill:#ffe4e6,stroke:#e11d48,stroke-width:1.5px,color:#881337
classDef toneIndigo fill:#e0e7ff,stroke:#4f46e5,stroke-width:1.5px,color:#312e81
classDef toneTeal fill:#ccfbf1,stroke:#0f766e,stroke-width:1.5px,color:#134e4a
class node_backtracking_examples toneBlue
class node_dp_examples toneAmber
class node_greedy_examples toneMint
class node_grasp_examples toneRose
class node_evolutionary_topic,node_student toneIndigo
class node_vector_notes,node_map_notes toneTeal
```

## Components

### Backtracking

- [Backtracking Exercises](https://github.com/jlcorcuera/pucp-adv-alg-2026-01/tree/main/cap-01-backtracking): `cap-01-backtracking`

### Dynamic Programming

- [DP Exercises](https://github.com/jlcorcuera/pucp-adv-alg-2026-01/tree/main/cap-02-dynamic-programming): `cap-02-dynamic-programming`

### Greedy Heuristics

- [Greedy Exercises](https://github.com/jlcorcuera/pucp-adv-alg-2026-01/tree/main/cap-03-heuristics): `cap-03-heuristics`

### GRASP Metaheuristics

- [GRASP Exercises](https://github.com/jlcorcuera/pucp-adv-alg-2026-01/tree/main/cap-04-metaheuristics): `cap-04-metaheuristics`

### Evolutionary Algorithms

- [Evolutionary Topic](https://github.com/jlcorcuera/pucp-adv-alg-2026-01/tree/main/cap-05-evolutionary-algorithms): `cap-05-evolutionary-algorithms`

### STL Notes

- [Vector Notes](https://github.com/jlcorcuera/pucp-adv-alg-2026-01/tree/main/add-notes-01-vector): `add-notes-01-vector`
- [Map Notes](https://github.com/jlcorcuera/pucp-adv-alg-2026-01/tree/main/add-notes-02-map): `add-notes-02-map`

### Other components

- **Student**

## Connections

- Student → Backtracking Exercises: selects exercises (evidence: `README.md`)
- Student → DP Exercises: selects exercises (evidence: `README.md`)
- Student → Greedy Exercises: selects exercises (evidence: `README.md`)
- Student → GRASP Exercises: selects exercises (evidence: `README.md`)
- Student → Evolutionary Topic: studies topic (evidence: `README.md`)
- Student → Vector Notes: reads notes (evidence: `README.md`)
- Student → Map Notes: reads notes (evidence: `README.md`)
