Skip to content

issue #401 fixed #408

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
KanishAnand wants to merge 1 commit into
base: master
Choose a base branch
from
Open

issue #401 fixed #408

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/lab/exp7/Theory.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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>
Expand Down