How nadeeshaamod/cit300_project works
This is a menu-driven university student-record and campus-route management application. A console user enters through Main, which validates input and coordinates student CRUD, service-request queueing, action history, student indexing, and campus-network operations. StudentLinkedList is documented as the master record store; Main also maintains the BST and hash table for sorted display and ID lookup. The graph models campus locations and roads and supports BFS/DFS traversal. Relationships are shown where the Main excerpt, source index, or README supports them; unsampled menu handlers limit detail about their individual operations.
Main entry points: Main.java Menu coordinator · Student.java Student record · StudentLinkedList.java Master record list · StudentBST.java ID-sorted BST
Components 9
Console workflow
- Menu coordinator
src/Main.java
Student records
- Student record
src/Student.java - Master record list
src/StudentLinkedList.java - ID-sorted BST
src/StudentBST.java - ID hash index
src/StudentHashTable.java
Requests and history
- Service request queue
src/ServiceRequestQueue.java - Action history stack
src/ActionStack.java
Campus routes
- Campus graph
src/CampusGraph.java
Other components
- Console user
Connections 11
- Console user → Menu coordinator: uses menu
Readme.MD - Menu coordinator → Student record: creates records
src/Main.java - Menu coordinator → Master record list: manages records
src/Main.java - Menu coordinator → ID-sorted BST: maintains index
src/Main.java - Menu coordinator → ID hash index: maintains index
src/Main.java - Menu coordinator → Service request queue: handles requests
src/Main.java - Menu coordinator → Action history stack: logs actions
src/Main.java - Menu coordinator → Campus graph: manages routes
src/Main.java - Master record list → Student record: stores records
src/StudentLinkedList.java - ID-sorted BST → Student record: indexes records
src/StudentBST.java - ID hash index → Student record: indexes records
src/StudentHashTable.java