Summary:  :DFS .
f(u) .
" :DFS f. G
T
DFS f. ".
:O(E+V).
- :DFS,
:low(v)=min{d(v), low(w) : w child(v), d(u) : (vu) is a back-edge}
-DFS -v " .
) ( w :low(w)¥ d(v).
.:O(E+V).
Kruskal ": )logVÿE(O. "
.
:O(Eÿ logV). Union-Find
.
Prim ": .
.:
' O(E+Vÿ logV).
)"(s:
-: , ,

Source: Azar, Yossi - School of Computer Science, Tel Aviv University

Collections: Computer Technologies and Information Sciences