How marcossincovich1/ayda2 works
This repository is a collection of graph-algorithm and backtracking exercises, rather than a single application. A typical graph workflow is to represent a graph with the shared ADT, then apply traversal, connectivity, shortest-path, or spanning-tree algorithms in individual exercises. Separate TP2 exercises model search state for combinatorial and board problems. The graph captures these distinct branches; many exercise implementations are indexed but not excerpted, so their runtime links are omitted or marked unverified rather than inferred.
Main entry points: Grafo.hpp Graph ADT · TP1 TP1 graph problems · main.cpp Graph demo · Dijkstra.hpp Dijkstra paths
Components 19
Graph foundation
- Graph ADT
TDAGrafo/HPPs/Grafo.hpp - Graph implementation
TDAGrafo/CPPs/Grafo.cpp - Graph demo
TDAGrafo/CPPs/main.cpp
Graph algorithms
- DFS traversal
TDAGrafoDFS/Algoritmos.cpp - Strong components
TP1/ejer11.cpp - Dijkstra paths
TP1/Dijkstra.hpp - Floyd paths
TP1/Floyd.hpp - Kruskal trees
TP1/Kruskal.hpp - Prim trees
TP1/Prim.hpp
TP1 exercises
TP2 backtracking
- Partition search
TP2/ej4/ejer4.cpp - Subset state
TP2/ej4/Conjunto.cpp - Pyramid exercise
TP2/ej6/ejer6.cpp - Pyramid state
TP2/ej6/Piramide.cpp - Garden tour
TP2/ej7/ejer7.cpp - Garden state
TP2/ej7/Jardin.cpp - Knight tour
TP2/ej8/ejer8.cpp - Board state
TP2/ej8/Tablero.cpp
Other components
- Learner
Connections 17
- Learner → Graph demo: runs demo
- Graph demo → Graph ADT: uses graph
TDAGrafo/CPPs/main.cpp - Graph implementation → Graph ADT: implements
TDAGrafo/CPPs/Grafo.cpp - DFS traversal → Graph ADT: traverses
TDAGrafoDFS/Algoritmos.cpp - Strong components → Graph ADT: traverses
TP1/ejer11.cpp - Dijkstra paths → Graph ADT: reads graph
TP1/Dijkstra.hpp - Floyd paths → Graph ADT: uses graph
TP1/Floyd.hpp - Kruskal trees → Graph ADT: uses graph
TP1/Kruskal.hpp - Prim trees → Graph ADT: uses graph
TP1/Prim.hpp - TP1 graph problems → Dijkstra paths: may invoke
TP1/ejer15.cpp - TP1 graph problems → Floyd paths: may invoke
TP1/ejer13.cpp - TP1 graph problems → Kruskal trees: may invoke
TP1/ejer16.cpp - TP1 graph problems → Prim trees: may invoke
TP1/ejer16.cpp - Partition search → Subset state: updates state
TP2/ej4/ejer4.cpp - Pyramid exercise → Pyramid state: may update
- Garden tour → Garden state: may update
- Knight tour → Board state: may update