Irish Road Network Graph Analysis

This project was completed as a college assignment analyzing road networks from the southern half of Ireland. A text file (wGraph1.txt) containing weighted road data was used to construct a graph, and several graph algorithms were applied to perform a series of tasks.

Project Highlights Graph Representation

Files: Graph.java & Edge.java

Implemented a flexible graph structure supporting weighted and unweighted edges.

Learned how to model nodes, edges, and adjacency relationships efficiently.

Graph Traversal

Files: BFTraversal.java (Breadth-First Search) & DFTraversal.java (Depth-First Search)

Implemented fundamental traversal strategies.

Gained understanding of recursion (DFS) and queue-based approaches (BFS), as well as search patterns in graphs.

Shortest Path Algorithm

File: DijkstrasAlgorithm.java

Implemented Dijkstra’s algorithm to compute shortest paths in weighted graphs.

Gained experience with priority queues, edge relaxation, and efficient pathfinding techniques.

Minimum Spanning Tree

File: PrimsAlgorithm.java

Implemented Prim’s algorithm to compute the minimum spanning tree of the road network.

I Learned about greedy strategies, graph connectivity, and optimization techniques.