বাংলায় প্রোগ্রামিং রিসোর্সসমূহ | Online Competitive Programming References

Modular and modern graph-theory algorithms framework in Java

I've written some important Algorithms and Data Structures in an efficient way in Java with references to time and space complexity. These Pre-cooked and well-tested codes help to implement larger hackathon problems in lesser time. DFS, BFS, LCA, LCS, Segment Tree, Sparce Table, All Pair Shortest Path, Binary Search, Matching and many more ...

Visualizes specific Graph Algorithms like BFS, DFS, MST etc. on interactive user input graphs.

Different Searching algorithms (DFS, BFS, IDS, Greedy, A*) opting to find optimal path from source to destination

Maze solving in java with BFS, DFS, A*

走迷宫问题的算法可视化(UI)及迷宫生成

This project contains the implementation of basic graph theory algorithms like BFS, DFS, Kruskal's MST, Prim's MST, Dijkstras Shortest Path

NxM puzzle solver using graph traversal algorithms

An implementation for 8 Puzzle problem with DFS, BFS, A Start, BDS, RBFS

Pathfinding Visualizer application that visualizes graph based search algorithms used to find the shortest path. Algorithms used: Breadth first search, Depth first search, Best first search and A* search made with java swing

All my leet code solutions in Java

图论学习相关笔记，包含算法java实现。

A Snake gameplay and auto play base on BFS , A-star and Greedy Algorithm

Breadth First Search & Depth First Search graph algorithms

Solve scrambled 2x2x2 Rubik’s Cubes in under a second using BFS

DFS / BFS / IDS / UCS / Bi-directional / A* / IDA* / SMA* / ...

CS50’s Introduction to Artificial Intelligence with Python. This course explores the concepts and algorithms at the foundation of modern artificial intelligence, diving into the ideas that give rise to technologies like game-playing engines, handwriting recognition, and machine translation.

Freecell solitaire Solver Project for Artificial Intelligence course from University of Macedonia

Personal repo of SUSTech course CS208 Algorithm Design