Mark all the correct statements. A) If u → v is a back edge, then pre [v]

Mark all the correct statements.<br>A) If u → v is a back edge, then pre [v] < pre [u] < post [u] < post [[v]<br>B) Ifu → v is a cross edge, then pre [u] < post [u] < pre [v] < post [v]<br>C)If u → v is a tree edge or a forward edge, then pre [u] < pre [v] < post [v] < post [u]<br>D) If u<br>→ v is a tree edge or a forward edge, then pre [v] < pre [u] < post [u] < post [v]<br>E) If u<br>v is a cross edge, then pre [v] < post [v] < pre [u] < post [u]<br>F) The running time of DFS is O (|V]²)<br>G)<br>Testing if a graph is directed acyclic (has no directed cycle) can be done in O (|V| + |E|) time.<br>A<br>E<br>G<br>B.<br>

Extracted text: Mark all the correct statements. A) If u → v is a back edge, then pre [v] < pre="" [u]="">< post="" [u]="">< post="" [[v]="" b)="" ifu="" →="" v="" is="" a="" cross="" edge,="" then="" pre="" [u]="">< post="" [u]="">< pre="" [v]="">< post="" [v]="" c)if="" u="" →="" v="" is="" a="" tree="" edge="" or="" a="" forward="" edge,="" then="" pre="" [u]="">< pre="" [v]="">< post="" [v]="">< post="" [u]="" d)="" if="" u="" →="" v="" is="" a="" tree="" edge="" or="" a="" forward="" edge,="" then="" pre="" [v]="">< pre="" [u]="">< post="" [u]="">< post="" [v]="" e)="" if="" u="" v="" is="" a="" cross="" edge,="" then="" pre="" [v]="">< post="" [v]="">< pre="" [u]="">< post="" [u]="" f)="" the="" running="" time="" of="" dfs="" is="" o="" (|v]²)="" g)="" testing="" if="" a="" graph="" is="" directed="" acyclic="" (has="" no="" directed="" cycle)="" can="" be="" done="" in="" o="" (|v|="" +="" |e|)="" time.="" a="" e="" g="">

Jun 11, 2022

SOLUTION.PDF

Mark all the correct statements. A) If u → v is a back edge, then pre [v]

Get Answer To This Question

Related Questions & Answers

Submit New Assignment