# Paghahanap na lalim-muna

Class Order in which the nodes are visited Search algorithm Graph ${\displaystyle O(|V|+|E|)}$ for explicit graphs traversed without repetition, ${\displaystyle O(b^{d})}$ for implicit graphs with branching factor b searched to depth d ${\displaystyle O(|V|)}$ if entire graph is traversed without repetition, O(longest path length searched) for implicit graphs without elimination of duplicate nodes