Pathfinding Project – COMP5017

📌 Overview

This project is part of the COMP5017 Data Structures and Algorithms module.

It implements graph-based pathfinding in Java and allows users to explore transport networks using classic algorithms.

• Load networks from .csv files
• Print network details
• Run traversal and pathfinding algorithms:
  • Breadth-First Search (BFS)
  • Depth-First Search (DFS)
  • Dijkstra’s Algorithm
  • A* Search

⚡ Features

• Graph representation using an adjacency matrix
• Input via .csv network files
• Assertions for pre/post-condition checks
• Route display with station names and total path length

🗂 Example CSV File

station Rame 65 120
station Antony 20 100
station Cawsand 130 60
station Kingsand 160 140
station Millbrook 65 100
station Penlee 110 120
station Polbathic 20 120
station Treninnow 110 100
link Rame Penlee 48
link Rame Millbrook 25
link Millbrook Cawsand 100
link Cawsand Kingsand 100
link Kingsand Rame 110
link Millbrook Treninnow 50
link Millbrook Antony 55
link Antony Polbathic 25
link Polbathic Rame 50

▶️ How to Run

1. Compile:

   javac comp50172023v2/*.java
   
   

2. Run:

   java comp50172023v2.COMP50172023CV2