This project is an implementation of several fundamental graph traversal and pathfinding algorithms in Java. It was completed as part of the CS 314: Data Structures course at The University of Texas ...

This project provides a simple implementation of a weighted undirected graph using adjacency linked lists, designed to efficiently handle sparse graphs. It includes several classic graph algorithms ...