From 9c7ac99fefceaf90302956b5ecf09a0c5bc1926d Mon Sep 17 00:00:00 2001
From: mrinalkhubchandani13 <mrinalkhubchandani13@gmail.com>
Date: Tue, 19 Mar 2019 01:11:51 +0530
Subject: [PATCH] Issue #176 fixed

---
 src/lab/exp8/Theory.html | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/lab/exp8/Theory.html b/src/lab/exp8/Theory.html
index b6840fe..d7b7137 100644
--- a/src/lab/exp8/Theory.html
+++ b/src/lab/exp8/Theory.html
@@ -142,7 +142,7 @@ <h3>Bellman-Ford</h3>
    end-for<br>
  end-for<br>
 <b>End-Bellman-Ford</b><br>
-</br></br></br></br></br></br></br></br></br></br></br></br></i>
+</br></i>
 </p>
 <p> 
 The algorithm requires <i>O(mn)</i> time, where <i>n</i> is the number of vertices and <i>m</i> is the number of edges.
@@ -188,7 +188,7 @@ <h3>Dijkstra</h3>
 
  end-for<br>
 <b>End-Dijkstra</b><br>
-</br></br></br></br></br></br></br></br></br></br></br></br></br></br></i>
+</br></i>
 </p>
 <p>
 We will analyze the algorithm when using a binary heap. A binary heap is built out of the n nodesa and there are <i>n</i>