Description: 1, depth-first search graph traversal algorithm: First visit to the designated start vertex V0, starting from V0, V0 a visit has not been visited adjacent vertex W1, starting from W1, W1, a visit has not been visited vertex of W2, and then starting from W2, W2 visit to a vertex not yet visited adjacent to W3, and so on, until all adjacent to a point have been visited so far.
To Search:
File list (Check if you may need any files):
Download