forked from algorithm-visualizer/algorithm-visualizer
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdesc.json
More file actions
15 lines (15 loc) · 907 Bytes
/
desc.json
File metadata and controls
15 lines (15 loc) · 907 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
{
"DLS": "Depth-Limited search (DLS) is an algorithm for traversing or searching tree or graph data structures. It's actually specific type of DFS where the search is limited to some depth from start node (root). One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores as far as possible (within some limit) along each branch before backtracking.",
"Complexity": {
"time": "worst $O(b^l)$",
"space": "worst $O(bl)$",
"notes" : "</br>b is branching factor, for example binary tree has branching factor 2 </br> l is limit that we define"
},
"References": [
"<a href='http://www.cs.colostate.edu/~anderson/cs440/index.html/doku.php?id=notes:week2b'>Colorado State University Lecture Notes</a>"
],
"files": {
"tree": "Searching a tree (limited depth)",
"count_descendant": "Count all descendant of root within some depth"
}
}