From 018fad19ae64388edfe69825a3f45ecd1fa83c04 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Fabiana=20=F0=9F=9A=80=20=20Campanari?=
 <113218619+FabianaCampanari@users.noreply.github.com>
Date: Sun, 1 Jun 2025 19:28:24 -0300
Subject: [PATCH] Update README.md
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Signed-off-by: Fabiana 🚀  Campanari <113218619+FabianaCampanari@users.noreply.github.com>
---
 README.md | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 8b65a01..e1b5d82 100644
--- a/README.md
+++ b/README.md
@@ -1815,7 +1815,9 @@ After running Solver, you should get a solution like:
 
 - [Exercise_1](https://github.com/Quantum-Software-Development/Optimization-Simulation-MathModeling-LinearProgramming/tree/51325dc92386be458fc4e097f174144eed789627/class__12-%20Shortest%20Path-Dijkstra's%20Algorithm/Exercise_1-Dijkstra's%20Algorithm%20Step-by-Step%20Solution) - Dijkstra's Algorithm Step-by-Step Solution
 
-- 
+- [Exercise_2](https://github.com/Quantum-Software-Development/Optimization-Simulation-MathModeling-LinearProgramming/tree/fea46e9b77b854da12b49ab2a73b1506221e6548/class__12-%20Shortest%20Path-Dijkstra's%20Algorithm/Exerc_2-Applying%20Dijkstra's%20Algorithm%20to%20the%20Shortest%20Path%20Problem) - Applying Dijkstra's Algorithm to the Shortest Path Problem /
+
+
 
 ### 🚜 Under Construction