Consider flight network having places of departure and destination. Flight network represent place name as a node and flight trajectories between palce names are the edges. Consider Pakistan cities as...

Consider flight network having places of departure and destination. Flight network represent
place name as a node and flight trajectories between palce names are the edges. Consider
Pakistan cities as a node and show the source and destination paths, show all the paths
separately with their labels and include their code as well.
Analyze this scenerio that tree or graph should implement here, justify and also implement this
with appropiate data structure.
Example:
Network represents that there are three cities named Karachi, Islamabad and Lahore. Flight
schedule from Karachi to Islamabad, Islamabad to Lahore and Lahore to Karchi. Places save
as class having departure time and day also.
Note: You are not allowed to use any built-in Data Structure classes to implement above scenario