This project consists of an application that calculates train routes between Ibernian cities. The system uses two files: a binary file containing the names of the origin and destination cities, along with the distance between them, and another file containing the names of cities and their coordinates (X, Y) on the map.
-
Feature 1
: Reading and Storing City Data- The city file is read, and its records are stored in a binary search tree.
- Each node in the city tree contains a city record, along with an initially empty Simple List to store the accessible paths from that city.
-
Feature 2
: Reading and Storing Path Data- The path file is read sequentially.
- Each path record is stored at the end of the linked list stored in the node of the originating city in the city tree.
-
Feature 3
: Train Route Calculation- The system can calculate train routes between Hibernian cities based on the data provided in the files.
C#
Binary Three
Linked List
Eduarda Paiva |
Eloisa Paixão |
---|