Complexity Time Space Adj. Matrix O(N Undirected 0(N) Adi List O(V +2IEDI 2/32021 Xiaojuan Cai 17
Complexity Time Space Undirected Adj. Matrix O(|V|2 ) O(|V|) Adj. List O(|V| + 2|E|) 2/3/2021 Xiaojuan Cai 17
DES application? OKAY, WHAT KINDS OF MGHTI PREPARE RR DAGER SNAKE VEOMS I sCATTERED 2) DANCING 9FuPRMOAR c COPPERHEAD 3R00D SNE ODACNFCIADQUg 0 IMHERETO PCK BY LD. THE INAND YuUi№RNB NOT DRESSED?a年NwE I REPULY NEED TD STOP 2/32021 Xiaojuan Cai USING DEPTH仲RRE5
DFS application? 2/3/2021 Xiaojuan Cai 19
Breadth-first search W Z z0449W M Xy WIZa BS tree 2/32021 Xiaojuan Cai 20
Breadth-first search u w x z a u x w z a u 1 x BFS tree 2/3/2021 Xiaojuan Cai 20
Algorithm 9. 4 BFS ut: a directed or undirected graph G=(V, E) Output: Numbering of the vertices in breadth-first search order 1.bn←0 for each vertexvE V 3. mark v unvisited en 5. for each vertexvE V 6. if v is marked unvisited then bfs() 1. end for Procedure bfs(v) Q+(vI 12345 ark y visited heQ≠ v←Pop(Q) tin←hfn+1 6. for each edge(,w)∈E 7. if w is marked unvisited then 89 Push(w, Q) ck w visited 10. end if en 12. end while 2/32021 Xiaojuan Cai
2/3/2021 Xiaojuan Cai 21
Quiz: Complexity Time Space Adi Matrix Undirected Adi. List 2/32021 Xiaojuan Cai 22
Quiz: Complexity Time Space Undirected Adj. Matrix ? ? Adj. List ? 2/3/2021 Xiaojuan Cai 22