Find Resources Fast
📍 360° Local Search (People Near Me)
Add New Patient/Donor
AI PATH FINDER
Shortest Path
Why this? Found using Breadth-First Search (BFS) exploring level by level. Guaranteed to find the location with the fewest hops/shortest physical distance from start.
Alternative Route
Why this? Found using Depth-First Search (DFS). Useful for finding alternative deeper matches when the nearest option isn't viable.
A* Heuristic Route
Why this? Found using the A* Algorithm. It uses geographic distance as a heuristic to actively move towards the target rather than blindly exploring.
Optimized Choice
Why this? Found using a structured Cost Function.
Cost = Distance + Wait Time + Availability
This result offers the lowest total cost, balancing drive time with hospital readiness.