Unbalanced Binary Search Tree with insertion, search, deletion, and DFS printing. Can flatten tree to array, then create balanced tree from array.
-
Updated
Nov 28, 2017 - JavaScript
Unbalanced Binary Search Tree with insertion, search, deletion, and DFS printing. Can flatten tree to array, then create balanced tree from array.
Learning the basics of modern AI
This was the first project of my Artificial Intelligence class. It includes a Mazer Generator based on DFS, as well as a Solver based on A*. Step by step visualizations of both are included, as well as an options menu to change parameters of the solving algorithm.
A visualization of common algorithms and algorithmic problems. Hosted @ https://iq.opengenus.org/bfs-visual/
Simple JavaScript Maze Runner game.
Sonic theme | Maze generator & solver
Problems solved on Leetcode
Sudoku-solving AI agent
CSE537 under IV Ramakrishnan
Breadth/Depth-First Search/Traversal
This program will generate a random maze and solve that complex puzzle by displaying the correct path. Algorithms are written in Python; visuals are displayed by pygame.
Assignments given during the course Informed Search Methods in AI in Reykjavik University, during the Double Degree study period.
project in python based on PyQT6 framework implementing the visualization of a shortest path search
Graph Data structure question from leetcode and geeksforgeeks in java.
This repo contains maze solver, which is implemented with DFS, BFS, A* and JPS algorithms.
A Course for learning Advanced Data Structures Algorithms.
Polytree and binary search trees, get a knight from starting point to end point on chess board
Add a description, image, and links to the depth-first-search topic page so that developers can more easily learn about it.
To associate your repository with the depth-first-search topic, visit your repo's landing page and select "manage topics."