Properties (56)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
algorithm
|
| gptkbp:hasStudentOrganizations |
O(V)
|
| https://www.w3.org/2000/01/rdf-schema#label |
DFS
|
| gptkbp:isA |
search algorithm
|
| gptkbp:isAccessibleBy |
undirected graphs
directed graphs |
| gptkbp:isEnhancedBy |
BFS
|
| gptkbp:isFoundIn |
BFS in some cases
|
| gptkbp:isNamedAfter |
finding shortest path
|
| gptkbp:isNotableFor |
large graphs with many nodes
|
| gptkbp:isRelatedTo |
BFS
|
| gptkbp:isUsedFor |
recursion
stack find connected components generate mazes solve Sudoku solve the N-Queens problem iterative_deepening_DFS |
| gptkbp:isUsedIn |
cryptography
image processing cloud computing computer graphics machine learning natural language processing network security parallel computing real-time systems bioinformatics data mining distributed systems compiler design constraint satisfaction problems software testing social network analysis network flow problems backtracking algorithms internet of things (IoT) AI for game playing topological sorting mobile computing web crawling pathfinding algorithms robot path planning database query optimization network routing algorithms cycle detection in graphs data structure design finding articulation points finding bridges in graphs finding strongly connected components game tree search solving puzzles like mazes |
| gptkbp:timeZone |
O(V_+_E)
|
| gptkbp:usedFor |
traversing tree structures
searching graphs |
| gptkbp:wasAffecting |
gptkb:Robert_Tarjan
|