This repo contains the implementation of an area coverage path planning project.

An image manipulator written in Python

flood fill a 2D map to create a Dijkstra map (distance map or field)

This is a Flood-Fill Algorithm Visualizer. This algorithm is mainly used to determine the bounded area connected to a given node in a multi-dimensional array.

Various Computer Graphics Algorithms

Small python projects

Python project implementing the working of flood fill algorithm using bfs in a 2D matrix. The algorithm uses a cross track bfs which looks for likely nodes [identical data points] surrounding a targeting node and replaces them. The same concept is used in computer graphics to flood fill pixels

A quick experiment: Region growing (AKA flood fill) algorithm implemented in Cython and Python

Matrix traversal using dept-first search with backtracking to count no. of contiguous zeroes adjacent to each other

flood_fill_algorithm

robot code for maze games

A simulation software that simulates a grid world to show the operation of maze solving using the Flood Fill algorithm

A simple 'Paint' using concept of BFS and DFS Algorithm

Slices an image into its constituent parts

Flood Fill coding challenge

"BFS-based Paint Bucket Simulation" for IF2211 final paper project

BFS, Dijkstra, Best First Search, A*