Anki Deck Changes

Note 1: ETH::1. Semester::A&D

Deck: ETH::1. Semester::A&D
Note Type: Horvath Cloze
GUID: AY}!l[d)1z

modified

Name the impossible cases in DFS pre/post ordering for edge \((u, v)\):

Overlapping but not nested intervals:
{{c2:: \(\text{pre}(u)<\text{pre}(v)<\text{post}(u)<\text{post}(v)\): As visit(u) would call visit(v) before the recursive call ends. }}

Name the impossible cases in DFS pre/post ordering for edge \((u, v)\):

Overlapping but not nested intervals:
{{c2:: \(\text{pre}(u)<\text{pre}(v)<\text{post}(u)<\text{post}(v)\): As visit(u) would call visit(v) before the recursive call ends. }}

Name the impossible cases in DFS pre/post ordering for edge \((u, v)\):

Overlapping but not nested intervals:
{{c2:: \(\text{pre}(u)<\text{post}(u)<\text{pre}(v)<\text{post}(v)\): As visit(u) would call visit(v) before the recursive call ends. }}

Name the impossible cases in DFS pre/post ordering for edge \((u, v)\):

Overlapping but not nested intervals:
{{c2:: \(\text{pre}(u)<\text{post}(u)<\text{pre}(v)<\text{post}(v)\): As visit(u) would call visit(v) before the recursive call ends. }}

Field-by-field Comparison

Field	Before	After
Text	Name the impossible cases in DFS pre/post ordering for edge \((u, v)\):<br><ul><li>{{c1::Overlapping but not nested intervals: <img src="paste-b7976dbbff12de2b44594553e0c91633f59e9c05.jpg">}}</li><li>{{c2:: \(\text{pre}(u)<\text{pre}(v)<\text{p~~ost~~}(u)<\text{post}(v)\): As visit(u) would call visit(v) before the recursive call ends. <img src="paste-a6fc070f96de8bd2b8148e3891cf956fd611a0a2.jpg"> }}</li></ul>	Name the impossible cases in DFS pre/post ordering for edge \((u, v)\):<br><ul><li>{{c1::Overlapping but not nested intervals: <img src="paste-b7976dbbff12de2b44594553e0c91633f59e9c05.jpg">}}</li><li>{{c2:: \(\text{pre}(u)<\text{post}(u)<\text{pre}(v)<\text{post}(v)\): As visit(u) would call visit(v) before the recursive call ends. <img src="paste-a6fc070f96de8bd2b8148e3891cf956fd611a0a2.jpg"> }}</li></ul>

Tags: ETH::1._Semester::A&D::09._Graph_Search::1._Depth_First_Search