A general-purpose lightweight C++ graph library

TOP 200 #Dev 🏆 LeetCode, Solutions in TypeScript, Shell, Database (T-SQL, PL/SQL, MySQL), Concurrency (Python3). @ S. Leschev. Google Engineering Level: L6+

Este repositorio alberga mi código para la práctica y competicion en concurso de programacion. Se desarrollan problema de distintas plataformaas online como Codeforces, Uva, CSES, Atcoder entre otros.

My Leetcode Solutions

An interactive web application that demonstrates various pathfinding algorithms in a visual format. This project allows users to see how algorithms explore paths and find the shortest route between points on a grid. The visualizer provides an intuitive way to understand complex algorithms like Dijkstra, A*, BFS, and DFS algorithms. Hope it helps!✨

A DFS algorithm designed to solve a maze.

Read, write and manipulate dfs0, dfs1, dfs2, dfs3, dfsu and mesh files.

To manage retro floppy disc images

Mouse-Maze: A Freshman Data Structure Course Project based on DFS

Kertish-dfs is a simple distributed storage platform, implements file storage on a single distributed computer cluster, and provides interfaces for file/folder handling. Kertish-dfs aims primarily for completely distributed operation without a single point of failure, scalable to the exabyte level.

Unity Pathfinders Visualized is a Unity project that visualizes fundamental pathfinding algorithms. It features Breadth-First Search (BFS) for efficient pathfinding in unweighted graphs, Depth-First Search (DFS) for deep exploration useful in maze generation, and Swarm Pathfinding, an alternative approach inspired by swarm behavior.

Solutions to the problems of the OBI (Brazilian Computer Olympiad) 2014.

Project 1, Introduction to Artificial Intelligence Course - informed and uninformed search algorithms

Data Structure and Algorithm

Find minimum number of flips required to make connect two disconnected islands

A cool(yes) path finding algorithm visualizer i made because i was feeling bored and well why not

This is the project of visual implementation of the searching algorithms BFS, DFS, and A* Algorithms

The Eight-Puzzle Game is a sliding puzzle consisting of a 3x3 grid with eight numbered tiles and one empty space, where the goal is to arrange the tiles in a specific order. To solve the puzzle, various AI algorithms can be employed, including Breadth-First Search (BFS), Depth-First Search (DFS), A* Search, Iterative Deepening Search (IDS)

This repo provides practical implementations of fundamental and advanced data structures and algorithms in Python. It includes clear and detailed examples across various categories, making it an essential resource for learning and applying key concepts in computer science.

Graph Data structure question from leetcode and geeksforgeeks in java.