Build a Graph Data Structure using adjacency list. the Graph Includes different Mtheods like add Node, addEdge, Print, DepthFirstTraversal both recursive and iterative using a stack , Breadth First search using a queue , topological sorting and hasCycle

path finder

Simple 2D maze generator using the Depth First algorithm with recursive backtracking

This is a script that can solve any sudoku puzzle you provide it, or you can simply ask it to generate one and solve it by itself

Depth First Search - stack implementation

This game solver implements DFS and BFS to generate step-by-step solutions for puzzles.

Recursively implemented a Trie Data Structure to support various word manipulations including Autocomplete. A trie is a 26-ary tree where the root node represents an empty string “” and if the kth (k going from 0 to 25) subtree is not a null subtree, it represents a string that is the concatenation of the characters represented by the parent and…

Puzzle 15 Solver using Best First Search and others

Depth First Search - recursive implementation

Personally developed programs of number-place solver, machine learning classification / regression and some experimental codes.