- Write DFS/BFS implementations in C and Java with search expression parsing (I've used Recursive Descent Parser in Java).
- Compare implementations based on paradigms, languages and their features used. Make a report.
The report may be found as a gist or duplicated to other formats in the Report subdirectory.