🚇 Explore optimal routes on the London Tube using DFS, BFS, UCS, and heuristics with this project for effective navigation and performance comparison.
-
Updated
Dec 17, 2025 - Jupyter Notebook
🚇 Explore optimal routes on the London Tube using DFS, BFS, UCS, and heuristics with this project for effective navigation and performance comparison.
Search algorithms (DFS, BFS, UCS, Heuristic) applied to the London Tube Map
Neo4j graph construction from unstructured data using LLMs
Beyond Vector Search: Hybrid Vector/Knowledge Graph Query Engine for Enhanced Data Retrieval
🎓💻University of Tehran Application of Intelligent Systems in Medicine Course Projects - Spring 2024
This is the backend for a RAG system that runs on Docker Compose. It registers documents in a wide range of file formats, which can be searched using the MCP server.
A university project implementing Vamana-Indexing-Algorithm (VIA) for Approximate-Nearest-Neighbors (ANN) problem.
Implementation of search algorithms from CS50's Introduction to Artificial Intelligence - includes DFS, BFS maze solvers with visual comparisons
Graphs Algorithms - Algorithms and Data Structure III
A visual tool for understanding the A* search algorithm. This project demonstrates the algorithm’s step-by-step pathfinding process using a graphical interface built in Python. It’s perfect for educational purposes and for anyone looking to explore efficient graph traversal techniques.
A Rust library for solving any river crossing puzzle, finding all optimal solutions, and providing a great learning resource for Rust and library design.
Search algorithms (DFS, BFS, UCS, Heuristic) applied to the London Tube Map
The Cogito Cube Solver project aims to develop an AI-driven solution for solving the Rubik's cube by combining traditional algorithms like 3BLD and Domino Reduction with advanced machine learning techniques
Patient Priority Management System is a Python-based project that prioritizes patient care based on illness severity, age, and arrival time using a min-heap priority queue, graph traversal for room allocation, and a binary search tree for efficient patient lookup. The system ensures optimal patient flow and room allocation in healthcare facilities.
CS50AI Introduction to AI with Python covers key AI concepts like machine learning, neural networks, and optimization, with practical Python programming applications.
tp final de estructuras de datos y algoritmos 1, del segundo año de la lcc
Pathfinding library for calculating all node pairs' shortest paths in an unweighted undirected graph.
Explore algorithms with practical examples: recursion, breadth-first search, KNN, binary search, and web scraping in Python.
The Tower Problem, as addressed in the Milton Friedman University's course, is successfully solved through the application of space state representation.
Add a description, image, and links to the graph-search topic page so that developers can more easily learn about it.
To associate your repository with the graph-search topic, visit your repo's landing page and select "manage topics."