Implementation of a dfs in C++.
Given a matrix of coloured tiles the algorithm will find the maximum number of adjoining tiles that are the same colour. Both a recursive and iterative implementation is provided.
-
Notifications
You must be signed in to change notification settings - Fork 0
dc-gh/dfs
About
Depth first search implementation to find adjacent tiles that are the same colour
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published