# marcossincovich1/ayda2 architecture

> Architecture diagram of the GitHub repository marcossincovich1/ayda2, generated by GitDiagram from its file tree, README and a sample of source files (last updated 2026-11-18). It is an AI-made overview: check details against the source.

- Interactive diagram: https://gitdiagram.com/marcossincovich1/ayda2
- Repository: https://github.com/marcossincovich1/ayda2

## Overview

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: [`TDAGrafo/HPPs/Grafo.hpp`](https://github.com/marcossincovich1/ayda2/blob/main/TDAGrafo/HPPs/Grafo.hpp) (Graph ADT), [`TP1`](https://github.com/marcossincovich1/ayda2/tree/main/TP1) (TP1 graph problems), [`TDAGrafo/CPPs/main.cpp`](https://github.com/marcossincovich1/ayda2/blob/main/TDAGrafo/CPPs/main.cpp) (Graph demo), [`TP1/Dijkstra.hpp`](https://github.com/marcossincovich1/ayda2/blob/main/TP1/Dijkstra.hpp) (Dijkstra paths)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_graph["Graph foundation"]
  node_graph_adt["Graph ADT<br/>[Grafo.hpp]"]
  node_graph_impl["Graph implementation<br/>[Grafo.cpp]"]
  node_graph_demo["Graph demo<br/>[main.cpp]"]
end

subgraph group_graph_algorithms["Graph algorithms"]
  node_dfs["DFS traversal<br/>[Algoritmos.cpp]"]
  node_scc["Strong components<br/>[ejer11.cpp]"]
  node_dijkstra["Dijkstra paths<br/>[Dijkstra.hpp]"]
  node_floyd["Floyd paths<br/>[Floyd.hpp]"]
  node_kruskal["Kruskal trees<br/>[Kruskal.hpp]"]
  node_prim["Prim trees<br/>[Prim.hpp]"]
end

subgraph group_tp1["TP1 exercises"]
  node_tp1_demos["TP1 graph problems"]
end

subgraph group_tp2["TP2 backtracking"]
  node_partition_solver["Partition search<br/>[ejer4.cpp]"]
  node_set_state["Subset state<br/>[Conjunto.cpp]"]
  node_pyramid_solver["Pyramid exercise<br/>[ejer6.cpp]"]
  node_pyramid_state["Pyramid state<br/>[Piramide.cpp]"]
  node_garden_solver["Garden tour<br/>[ejer7.cpp]"]
  node_garden_state["Garden state<br/>[Jardin.cpp]"]
  node_board_solver["Knight tour<br/>[ejer8.cpp]"]
  node_board_state["Board state<br/>[Tablero.cpp]"]
end

node_user(("Learner"))

node_user -.->|"runs demo"| node_graph_demo
node_graph_demo -->|"uses graph"| node_graph_adt
node_graph_impl -->|"implements"| node_graph_adt
node_dfs -->|"traverses"| node_graph_adt
node_scc -->|"traverses"| node_graph_adt
node_dijkstra -->|"reads graph"| node_graph_adt
node_floyd -->|"uses graph"| node_graph_adt
node_kruskal -->|"uses graph"| node_graph_adt
node_prim -->|"uses graph"| node_graph_adt
node_tp1_demos -.->|"may invoke"| node_dijkstra
node_tp1_demos -.->|"may invoke"| node_floyd
node_tp1_demos -.->|"may invoke"| node_kruskal
node_tp1_demos -.->|"may invoke"| node_prim
node_partition_solver -->|"updates state"| node_set_state
node_pyramid_solver -.->|"may update"| node_pyramid_state
node_garden_solver -.->|"may update"| node_garden_state
node_board_solver -.->|"may update"| node_board_state

click node_graph_adt "https://github.com/marcossincovich1/ayda2/blob/main/TDAGrafo/HPPs/Grafo.hpp"
click node_graph_impl "https://github.com/marcossincovich1/ayda2/blob/main/TDAGrafo/CPPs/Grafo.cpp"
click node_graph_demo "https://github.com/marcossincovich1/ayda2/blob/main/TDAGrafo/CPPs/main.cpp"
click node_dfs "https://github.com/marcossincovich1/ayda2/blob/main/TDAGrafoDFS/Algoritmos.cpp"
click node_scc "https://github.com/marcossincovich1/ayda2/blob/main/TP1/ejer11.cpp"
click node_dijkstra "https://github.com/marcossincovich1/ayda2/blob/main/TP1/Dijkstra.hpp"
click node_floyd "https://github.com/marcossincovich1/ayda2/blob/main/TP1/Floyd.hpp"
click node_kruskal "https://github.com/marcossincovich1/ayda2/blob/main/TP1/Kruskal.hpp"
click node_prim "https://github.com/marcossincovich1/ayda2/blob/main/TP1/Prim.hpp"
click node_tp1_demos "https://github.com/marcossincovich1/ayda2/tree/main/TP1"
click node_partition_solver "https://github.com/marcossincovich1/ayda2/blob/main/TP2/ej4/ejer4.cpp"
click node_set_state "https://github.com/marcossincovich1/ayda2/blob/main/TP2/ej4/Conjunto.cpp"
click node_pyramid_solver "https://github.com/marcossincovich1/ayda2/blob/main/TP2/ej6/ejer6.cpp"
click node_pyramid_state "https://github.com/marcossincovich1/ayda2/blob/main/TP2/ej6/Piramide.cpp"
click node_garden_solver "https://github.com/marcossincovich1/ayda2/blob/main/TP2/ej7/ejer7.cpp"
click node_garden_state "https://github.com/marcossincovich1/ayda2/blob/main/TP2/ej7/Jardin.cpp"
click node_board_solver "https://github.com/marcossincovich1/ayda2/blob/main/TP2/ej8/ejer8.cpp"
click node_board_state "https://github.com/marcossincovich1/ayda2/blob/main/TP2/ej8/Tablero.cpp"

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_graph_adt,node_graph_impl,node_graph_demo toneBlue
class node_dfs,node_scc,node_dijkstra,node_floyd,node_kruskal,node_prim toneAmber
class node_tp1_demos toneMint
class node_partition_solver,node_set_state,node_pyramid_solver,node_pyramid_state,node_garden_solver,node_garden_state,node_board_solver,node_board_state toneRose
class node_user toneIndigo
```

## Components

### Graph foundation

- [Graph ADT](https://github.com/marcossincovich1/ayda2/blob/main/TDAGrafo/HPPs/Grafo.hpp): `TDAGrafo/HPPs/Grafo.hpp`
- [Graph implementation](https://github.com/marcossincovich1/ayda2/blob/main/TDAGrafo/CPPs/Grafo.cpp): `TDAGrafo/CPPs/Grafo.cpp`
- [Graph demo](https://github.com/marcossincovich1/ayda2/blob/main/TDAGrafo/CPPs/main.cpp): `TDAGrafo/CPPs/main.cpp`

### Graph algorithms

- [DFS traversal](https://github.com/marcossincovich1/ayda2/blob/main/TDAGrafoDFS/Algoritmos.cpp): `TDAGrafoDFS/Algoritmos.cpp`
- [Strong components](https://github.com/marcossincovich1/ayda2/blob/main/TP1/ejer11.cpp): `TP1/ejer11.cpp`
- [Dijkstra paths](https://github.com/marcossincovich1/ayda2/blob/main/TP1/Dijkstra.hpp): `TP1/Dijkstra.hpp`
- [Floyd paths](https://github.com/marcossincovich1/ayda2/blob/main/TP1/Floyd.hpp): `TP1/Floyd.hpp`
- [Kruskal trees](https://github.com/marcossincovich1/ayda2/blob/main/TP1/Kruskal.hpp): `TP1/Kruskal.hpp`
- [Prim trees](https://github.com/marcossincovich1/ayda2/blob/main/TP1/Prim.hpp): `TP1/Prim.hpp`

### TP1 exercises

- [TP1 graph problems](https://github.com/marcossincovich1/ayda2/tree/main/TP1): `TP1`

### TP2 backtracking

- [Partition search](https://github.com/marcossincovich1/ayda2/blob/main/TP2/ej4/ejer4.cpp): `TP2/ej4/ejer4.cpp`
- [Subset state](https://github.com/marcossincovich1/ayda2/blob/main/TP2/ej4/Conjunto.cpp): `TP2/ej4/Conjunto.cpp`
- [Pyramid exercise](https://github.com/marcossincovich1/ayda2/blob/main/TP2/ej6/ejer6.cpp): `TP2/ej6/ejer6.cpp`
- [Pyramid state](https://github.com/marcossincovich1/ayda2/blob/main/TP2/ej6/Piramide.cpp): `TP2/ej6/Piramide.cpp`
- [Garden tour](https://github.com/marcossincovich1/ayda2/blob/main/TP2/ej7/ejer7.cpp): `TP2/ej7/ejer7.cpp`
- [Garden state](https://github.com/marcossincovich1/ayda2/blob/main/TP2/ej7/Jardin.cpp): `TP2/ej7/Jardin.cpp`
- [Knight tour](https://github.com/marcossincovich1/ayda2/blob/main/TP2/ej8/ejer8.cpp): `TP2/ej8/ejer8.cpp`
- [Board state](https://github.com/marcossincovich1/ayda2/blob/main/TP2/ej8/Tablero.cpp): `TP2/ej8/Tablero.cpp`

### Other components

- **Learner**

## Connections

- Learner → Graph demo: runs demo
- Graph demo → Graph ADT: uses graph (evidence: `TDAGrafo/CPPs/main.cpp`)
- Graph implementation → Graph ADT: implements (evidence: `TDAGrafo/CPPs/Grafo.cpp`)
- DFS traversal → Graph ADT: traverses (evidence: `TDAGrafoDFS/Algoritmos.cpp`)
- Strong components → Graph ADT: traverses (evidence: `TP1/ejer11.cpp`)
- Dijkstra paths → Graph ADT: reads graph (evidence: `TP1/Dijkstra.hpp`)
- Floyd paths → Graph ADT: uses graph (evidence: `TP1/Floyd.hpp`)
- Kruskal trees → Graph ADT: uses graph (evidence: `TP1/Kruskal.hpp`)
- Prim trees → Graph ADT: uses graph (evidence: `TP1/Prim.hpp`)
- TP1 graph problems → Dijkstra paths: may invoke (evidence: `TP1/ejer15.cpp`)
- TP1 graph problems → Floyd paths: may invoke (evidence: `TP1/ejer13.cpp`)
- TP1 graph problems → Kruskal trees: may invoke (evidence: `TP1/ejer16.cpp`)
- TP1 graph problems → Prim trees: may invoke (evidence: `TP1/ejer16.cpp`)
- Partition search → Subset state: updates state (evidence: `TP2/ej4/ejer4.cpp`)
- Pyramid exercise → Pyramid state: may update
- Garden tour → Garden state: may update
- Knight tour → Board state: may update
