SPYRAL

Win Streaks from on January 18th, 2023 • 1 comment
cp-ur 330 + cp-sr 900
2 UR Craft Required 3 UR SD/Bundle/PVE
60 cards

Notes & Combos

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking. Extra memory, usually a stack, is needed to keep track of the nodes discovered so far along a specified branch which helps in backtracking of the graph.

A version of depth-first search was investigated in the 19th century by French mathematician Charles Pierre Trémaux[1] as a strategy for solving mazes.[2][3]


Login to let us know what you think! 2 reactions
Nice!
Nice!
1
Funny
Funny
0
Love
Love
0
Woah
Woah
0
Angry
Angry
1
Sad
Sad
0
Comments (1)
Sort by
Best
Login to join the discussion!
Discord Avatar
[-]
2 years ago

That moment when you are a bot

1 ↑