Implementation of Algorithms and Data Structures, Problems and Solutions

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

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实现。

Breadth First Search & Depth First Search graph algorithms

JCIFS is an Open Source client library that implements the CIFS/SMB networking protocol in 100% Java.

Algorithms and Data structures final project

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.

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

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

Personal repo of SUSTech course CS208 Algorithm Design

Algoritmos de Grafos. Grafos No Dirigidos No Ponderados y Ponderados. Grafos Dirigidos Ponderados. Coloreo de Grafos con algoritmos Secuencial Aleatorio, Welsh-Powell y Matula. Algoritmos de Dijkstra, Prim, Kruskal, Floyd, Warshall. Búsqueda en Profundidad (DFS) y Búsqueda en Anchura (BFS).

🌽 Maze Generation & Solver - Automatically generates a maze and solves the maze using Breadth-First Search (BFS) and Depth-First Search (DFS)

Paradise of Algorithms