How jlcorcuera/pucp-adv-alg-2026-01 works
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 Backtracking Exercises · cap-02-dynamic-programming DP Exercises · cap-03-heuristics Greedy Exercises · cap-04-metaheuristics GRASP Exercises
Components 8
Backtracking
- Backtracking Exercises
cap-01-backtracking
Dynamic Programming
- DP Exercises
cap-02-dynamic-programming
Greedy Heuristics
- Greedy Exercises
cap-03-heuristics
GRASP Metaheuristics
- GRASP Exercises
cap-04-metaheuristics
Evolutionary Algorithms
- Evolutionary Topic
cap-05-evolutionary-algorithms
STL Notes
- Vector Notes
add-notes-01-vector - Map Notes
add-notes-02-map
Other components
- Student
Connections 7
- Student → Backtracking Exercises: selects exercises
README.md - Student → DP Exercises: selects exercises
README.md - Student → Greedy Exercises: selects exercises
README.md - Student → GRASP Exercises: selects exercises
README.md - Student → Evolutionary Topic: studies topic
README.md - Student → Vector Notes: reads notes
README.md - Student → Map Notes: reads notes
README.md