BFS Friend Finder

BFS Friend Finder is a graph-based web application developed to demonstrate the practical use of the Breadth-First Search (BFS) algorithm in a real-world inspired scenario. In the application, each person is represented as a vertex while friendships are represented as unweighted edges in a graph. The system allows users to create people, define friendship relationships, and search for the shortest connection path between two individuals. The BFS traversal process is visualised step-by-step, showing how nodes are explored level-by-level using a queue structure. The frontend was built using React to provide an interactive and intuitive visualisation experience, while the backend was implemented using FastAPI and Python to handle graph processing and BFS traversal logic. The project was developed as part of an evaluation and implementation assignment focused on data structures and algorithms.