Depth First Directed Paths Algorithm

A version of depth-first search was investigated in the 19th century by French mathematician Charles Pierre Trémaux as a strategy for solve mazes. Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures.

Depth First Directed Paths source code, pseudocode and analysis

COMING SOON!