Thursday, July 15, 2010

still my favourite picture of ellen page oh my word where got so chio one
Sunday, July 11, 2010
eh teach me your concept please
Saturday, July 10, 2010

Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking. (Y)