IEEE

Comparative Analysis of A*, Dijkstra’s, and Breadth-First Search Algorithms: Evaluating Complexity, Optimality, and Efficiency in Shortest Pathfinding

Abstract: This paper presents a comparative analysis of three widely used pathfinding algorithms: A*, Dijistra’s, and Breadth-First Search (BFS). We evaluate these algorithms based on their complexity ...
GitHub

[OSDI'25 Artifact] Achieving Low-Latency Graph-Based Vector Search via Aligning Best-First Search Algorithm with SSD

Welcome to the artifact repository of OSDI'25 accepted paper: Achieving Low-Latency Graph-Based Vector Search via Aligning Best-First Search Algorithm with SSD! This repository contains the ...
IEEE

Comparative Analysis between BFS and DFS-Shortest Path Algorithms

Abstract: Graph theory is a critical field in computer science and mathematics, particularly in solving shortest path problems. In this paper, a comparative analysis of Breadth-First Search (BFS) and ...