Recursive DFS solver for subset sum problem.

Trabalho Prático da Disciplina de Algoritmos e Estruturas de Dados 1

Solving missionary cannibal problem using different search strategies in C

The game linkage by minimax algorithm

Counts number of regions in a 2D binary matrix

My first project in C language

Designed to crack the Traveling Salesman Problem, this program employs graph theory, depth-first search, and a stack for efficient route optimization. Tailored for budget-conscious users navigating city routes, it guarantees an optimal journey starting and concluding in Santa Cruz, with each city visited precisely once.

An introduction to different algorithmic approach

Graph Search, DFS - Algorithm - C - 42 School

This is a program that counts "towns" and sorts it by it's size

Command-line Sokoban game in C with automatic pathfinding, undo support, and strict memory-safety.

graph sorting using DFS and BFS