Description Usage Arguments See Also
One starts at the root and explores as far as possible along each branch before backtracking.
1 | dfs(s,visited,adj)
|
s |
The root node. |
visited |
N by 1 vector, where N is the number of nodes. This vector records whether nodes have been visited or not with 1 if visited and 0 otherwise. |
adj |
N by N adjacent matrix. |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.