graph-search

XERJ is the new way for AI to search data. Its autoindex capability activates agents to know your data without the token waste of grep (1974 tool). One command indexes code, docs, logs and PDFs for search, RAG, security audits and agent memory, using 40x fewer tokens than grep. It’s durable and can replace ElasticSearch saving you x10 infra costs.

Neo4j graph construction from unstructured data using LLMs

Hipster4j is a lightweight and powerful heuristic search library for Java and Android. It contains common, fully customizable algorithms such as Dijkstra, A* (A-Star), DFS, BFS, Bellman-Ford and more.

H2MN: Graph Similarity Learning with Hierarchical Hypergraph Matching Networks (KDD-2021)

Pathfinding library for calculating all node pairs' shortest paths in an unweighted undirected graph.

Notebook for quick search

A cool project in which we do path planning in an environment with moving obstacles and large scale fixed obstacles. We use two different representations of the world to handle the fixed and moving obstacles.

The differential drive has an ESP32 board for wireless connectivity a Client-Server network is established between the server laptop and client ESP to transmit the coordinates to the robot. An overhead camera is used to visually survey the obstacle course and image processing is used to segment the obstacles and the robot from the captured image…

🛩️⚙️ 3D Planning, PID Control, Extended Kalman Filter for the Udacity Flying Car Nanodegree // FCND-Term1

This repository contains my Implementation of hybrid A star for a vehicle with Ackerman steering to perform complex parking maneuvers in tight parking spaces

No longer being supported or maintained. A Graph Theory & Data Structure Library for JavaScript.

Implement Algorithms For Graph Search (like A*) & Local Search (like hill climbing algorithms) & Genetics

A* graph-search algorithm for solving 2x2x2 Rubik's Cube.

Efficient shortest path queries over large static/dynamic graphs

CS Graph editor : Javscript based frontend visual graph editor

some Graph Search Methods in Unity3D and C# 📐📌

A university project implementing Vamana-Indexing-Algorithm (VIA) for Approximate-Nearest-Neighbors (ANN) problem.

Planning Project Implementation for the Udacity Artificial Intelligence Nanodegree Program

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.

Problem Solving With AI Approaches: Heuristic Searches, Statistical Classifications