COS2611 Assignment 4 solutions 2025
Smart City Route Management System
Course:
Assignment: Smart City Route Management System — Implementation and Report
Student Name:
Student Number:
Date: 18 September 2025
Cover Page & Declaration
I declare that this submission is my own work and that I followed the requirements of the
assignment brief. All code and documentation were written by me unless otherwise
referenced.
Signature: ____________________
, Table of Contents
1. Background
2. Requirements (brief)
3. Approach and Design
4. Data Structures & Algorithms Used
5. Program Source Code (C++)
6. How to compile and run
7. Sample Inputs & Outputs (Demonstration)
8. Limitations and Possible Extensions (including optional AI)
9. Conclusion
10. References
1. Background
Cities require efficient transport routes to reduce travel times, congestion, and costs. This
project implements a route management system in C++ that models city intersections
(nodes) and routes (edges) and finds optimal routes using graph algorithms.
2. Requirements (brief)
• Implement in C++.
• Use appropriate data structures to represent the network (graph).
• Provide functions: add node, add edge, update route, find shortest route.
• Implement Dijkstra’s algorithm (and helper utilities).
• Print clear outputs.
• Submit source code and a report (this document).
3. Approach and Design
• Representation: A weighted directed graph using adjacency lists.
• Node IDs: Strings (e.g., “A”, “B”, “Intersection_12”).
• Edge weights: represent travel cost (distance, time or combined metric). For
simplicity this implementation uses integer weights (imaginable as minutes).
• Algorithms: Dijkstra for shortest path; simple comparison between two found
routes.
• Menu-driven console program: allows adding nodes, adding/updating edges,
querying shortest path, comparing routes, and showing the current graph.
Smart City Route Management System
Course:
Assignment: Smart City Route Management System — Implementation and Report
Student Name:
Student Number:
Date: 18 September 2025
Cover Page & Declaration
I declare that this submission is my own work and that I followed the requirements of the
assignment brief. All code and documentation were written by me unless otherwise
referenced.
Signature: ____________________
, Table of Contents
1. Background
2. Requirements (brief)
3. Approach and Design
4. Data Structures & Algorithms Used
5. Program Source Code (C++)
6. How to compile and run
7. Sample Inputs & Outputs (Demonstration)
8. Limitations and Possible Extensions (including optional AI)
9. Conclusion
10. References
1. Background
Cities require efficient transport routes to reduce travel times, congestion, and costs. This
project implements a route management system in C++ that models city intersections
(nodes) and routes (edges) and finds optimal routes using graph algorithms.
2. Requirements (brief)
• Implement in C++.
• Use appropriate data structures to represent the network (graph).
• Provide functions: add node, add edge, update route, find shortest route.
• Implement Dijkstra’s algorithm (and helper utilities).
• Print clear outputs.
• Submit source code and a report (this document).
3. Approach and Design
• Representation: A weighted directed graph using adjacency lists.
• Node IDs: Strings (e.g., “A”, “B”, “Intersection_12”).
• Edge weights: represent travel cost (distance, time or combined metric). For
simplicity this implementation uses integer weights (imaginable as minutes).
• Algorithms: Dijkstra for shortest path; simple comparison between two found
routes.
• Menu-driven console program: allows adding nodes, adding/updating edges,
querying shortest path, comparing routes, and showing the current graph.
