Example Implementation of (Breadth First Search, Depth First Search, Best First Search, A*, Branch & Bound, and Dynamic Programming) Algorithms with Java Console App
-
Updated
Apr 3, 2026 - Java
Example Implementation of (Breadth First Search, Depth First Search, Best First Search, A*, Branch & Bound, and Dynamic Programming) Algorithms with Java Console App
Interactive React-based pathfinding visualizer with BFS, DFS, A*, Hill Climbing, Best First, and MiniMax algorithms, featuring animated grid exploration, wall editing, and results analysis.
A Python project that takes two Wikipedia articles and finds the bridge between them.
Produs software care are ca scop diminuarea efectelor dezastrelor naturale sau tehnologice, simularea procesului de evacuare a populației din zonele afectate, precum și organizarea sistemului de asistență a persoanelor rănite
Automotive AI Systems is a project that combines three AI approaches for automotive applications: an ontology with SPARQL queries, grid-based search algorithm comparisons (IDDFS vs Best-First), and AMT anomaly detection using rule-based, fuzzy logic, and Random Forest models.
AI-based sign language recognition using deep learning, research gap analysis, and optimized search techniques.
A perfect maze generator with animations
Add a description, image, and links to the best-first-serach topic page so that developers can more easily learn about it.
To associate your repository with the best-first-serach topic, visit your repo's landing page and select "manage topics."