IEEE

A Breadth First Search Algorithm for Data Clustering based on Space-time Curvature

Abstract: In this paper, we present a novel data clustering approach, i.e., a Breadth First Search (BFS) algorithm based on space-time curvature, or BFS Curvature for short. Inspired by Einstein’s ...
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

AI Pathfinder - Uninformed Search Visualization

This project implements an AI Pathfinder that visualizes how different uninformed search algorithms explore a grid environment to find the optimal path from a start point to a goal point while ...
GitHub

5th Semester Computer Networks Lab Programs

This repository contains local lab programs for the 5th Semester Computer Networks course. The programs cover network simulations using NS-2 (TCL) and network protocols/algorithms implemented in Java.