diff --git a/src/lab/exp7/Theory.html b/src/lab/exp7/Theory.html
index 7b19d8d..d3754b9 100644
--- a/src/lab/exp7/Theory.html
+++ b/src/lab/exp7/Theory.html
@@ -214,7 +214,7 @@ <h3>Depth First Search (DFS)</h3>
 <i>u</i> can be reached from <i>v</i> using tree edges, but there an edge from <i>u</i> to <i>v</i> also.
 <ul><li><i>An edge (u,v)</i> is a back edge if [d(u), f(u)]  is a subinterval of [d(v), f(v)]</li></ul>
 </li>
-<br/>
+<p><b>The following two Edges : Forward Edge and Cross Edge are only present in Directed Graph.</b></p>
 <li><u>Forward Edges</u> : A non-tree edge <i>(u, v)</i> is called as a forward edge if <i>v</i> is a descendant of <i>u</i> in the 
 dfs tree. <i>v</i> can be reached from <i>u</i> using tree edges, but there an edge from <i>u</i> to <i>v</i> also.
 <ul><li><i>An edge (u,v)</i> is a forward edge if [d(v), f(v)] is a subinterval of [d(u), f(u)].</li></ul>