diff --git a/class__12- Shortest Path-Dijkstra's Algorithm/Exerc_3-Applying Dijkstra's Algorithm to the Shortest Path Problem/exerc_3-Applying Dijkstra's Algorithm to the Shortest Path Problem.md b/class__12- Shortest Path-Dijkstra's Algorithm/Exerc_3-Applying Dijkstra's Algorithm to the Shortest Path Problem/exerc_3-Applying Dijkstra's Algorithm to the Shortest Path Problem.md
index cdf5e2a..8764f08 100644
--- a/class__12- Shortest Path-Dijkstra's Algorithm/Exerc_3-Applying Dijkstra's Algorithm to the Shortest Path Problem/exerc_3-Applying Dijkstra's Algorithm to the Shortest Path Problem.md	
+++ b/class__12- Shortest Path-Dijkstra's Algorithm/Exerc_3-Applying Dijkstra's Algorithm to the Shortest Path Problem/exerc_3-Applying Dijkstra's Algorithm to the Shortest Path Problem.md	
@@ -1,5 +1,5 @@
 
-```markdown
+
 ## Example 3: Step-by-Step Tableau for Dijkstra's Algorithm
 
 Below are the tableaus (tabulações) representing each iteration of Dijkstra's algorithm for Example 3, as described in the PDF[^1].
@@ -90,7 +90,7 @@ Below are the tableaus (tabulações) representing each iteration of Dijkstra's
 - **Total Time:** 65 seconds
 
 These tableaus follow the standard Dijkstra's procedure, allowing step-by-step verification and understanding of the shortest path calculation in the network.
-```
 
 
-[
\ No newline at end of file
+
+[