Statements (61)
| Predicate | Object |
|---|---|
| gptkbp:instance_of |
gptkb:Artificial_Intelligence
|
| gptkbp:can_be_used_with |
adjacency matrix
adjacency list |
| gptkbp:can_lead_to |
deep recursion issues
|
| gptkbp:has_time_complexity |
O(V + E)
|
| gptkbp:has_variants |
iterative DFS
recursive DFS |
| https://www.w3.org/2000/01/rdf-schema#label |
DFS
|
| gptkbp:is_implemented_in |
recursion
stack |
| gptkbp:is_not_optimal_for |
weighted graphs
|
| gptkbp:is_related_to |
BFS
|
| gptkbp:is_used_in |
gptkb:crypt
gptkb:Graphics_Processing_Unit gptkb:quantum_computing gptkb:cloud_computing gptkb:machine_learning image processing data visualization natural language processing network security parallel computing real-time systems bioinformatics data mining distributed systems network routing AI planning compiler design software testing social network analysis network analysis backtracking algorithms AI for game playing topological sorting mobile computing web crawling pathfinding algorithms big data analysis robot path planning database query optimization cycle detection in graphs finding articulation points finding bridges in graphs finding strongly connected components solving puzzles like mazes Io T applications XML/ HTML parsing connected components detection data structure exploration decision tree analysis file system traversal game tree exploration solving Sudoku |
| gptkbp:suitable_for |
finding shortest path
|
| gptkbp:used_for |
traversing tree structures
searching graphs |
| gptkbp:bfsParent |
gptkb:DFS_Group
gptkb:NFS_(Network_File_System) gptkb:Discover_Financial_Services |
| gptkbp:bfsLayer |
5
|