|
gptkbp:instanceOf
|
gptkb:algorithm
|
|
gptkbp:alsoKnownAs
|
DFS
|
|
gptkbp:canBe
|
articulation points
strongly connected components
path finding
bridges in a graph
component labeling
topological ordering
|
|
gptkbp:category
|
gptkb:search_engine
graph
tree algorithm
|
|
gptkbp:complexity
|
O(V+E)
|
|
gptkbp:discoveredBy
|
gptkb:Robert_Tarjan
gptkb:Pierre_Rosenstiehl
|
|
gptkbp:explores
|
as far as possible along each branch before backtracking
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Depth-First Search
|
|
gptkbp:implementedIn
|
recursion
stack
|
|
gptkbp:input
|
gptkb:tree
graph
|
|
gptkbp:introducedIn
|
1970
|
|
gptkbp:isRecursive
|
true
|
|
gptkbp:numberOfIssues
|
false
|
|
gptkbp:optimizedFor
|
false
|
|
gptkbp:relatedTo
|
gptkb:Breadth-First_Search
gptkb:Iterative_Deepening_Depth-First_Search
|
|
gptkbp:searchStrategy
|
LIFO
|
|
gptkbp:spaceComplexity
|
O(V)
|
|
gptkbp:traversalOrder
|
postorder
preorder
|
|
gptkbp:usedFor
|
graph traversal
tree traversal
|
|
gptkbp:usedIn
|
topological sorting
finding connected components
cycle detection
solving mazes
|
|
gptkbp:bfsParent
|
gptkb:Stack_algorithm
gptkb:Graph_Algorithms
|
|
gptkbp:bfsLayer
|
6
|