https://github.com/basemax/depthfirstsearchjava

This is a Java implementation of the Depth-First-Search algorithm. It is a recursive algorithm that traverses a graph in a depthward motion and uses a stack to remember to get the next vertex to start a search, when a dead end occurs in any iteration.

data-structure datastructure depth-first-search dfs dfs-algorithm dfs-java ds java java-dfs

Last synced: 03 Apr 2025