Counts number of regions in a 2D binary matrix
-
Updated
Aug 4, 2021 - C
Counts number of regions in a 2D binary matrix
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.
The game linkage by minimax algorithm
Solving missionary cannibal problem using different search strategies in C
My first project in C language
graph sorting using DFS and BFS
An introduction to different algorithmic approach
This is a program that counts "towns" and sorts it by it's size
Trabalho Prático da Disciplina de Algoritmos e Estruturas de Dados 1
Add a description, image, and links to the dfs-search topic page so that developers can more easily learn about it.
To associate your repository with the dfs-search topic, visit your repo's landing page and select "manage topics."