From 00dc23adc27dbcd34d411ca59746e6d1d7550c14 Mon Sep 17 00:00:00 2001
From: Meisterlala <6453306+Meisterlala@users.noreply.github.com>
Date: Wed, 30 Mar 2022 20:18:41 +0200
Subject: [PATCH] Increased image width

---
 Algorithms Specialization/Part 3/README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Algorithms Specialization/Part 3/README.md b/Algorithms Specialization/Part 3/README.md
index 88e801b..39d14f7 100644
--- a/Algorithms Specialization/Part 3/README.md	
+++ b/Algorithms Specialization/Part 3/README.md	
@@ -9,7 +9,7 @@ The primary topics in this part of the specialization are: greedy algorithms (sc
 ### Extra
 
 I analysed the runtime of different minimum spanning tree algorithms and compared the running time. Although the asymtotic analysis predicts the opposite, Prim's MST algorithm is faster than Pettie and Ramachandran optimal minimum spanning tree algorithm.
-<img src="mst.svg" width="90%">
+<img src="mst.svg" width="100%">
 
 ### Week 1
 
-- 
2.51.2