Subway Navigation finds optimal path for Korean subway navigation. It uses dijkstra algorithm to find the shortest or minimum transfer path.

1. Execute the program by entering gcc ./subway_navigation.c && ./a.out to console

2. Enter departure station name

3. Enter destination station name

4. Enter method

4-1. Shortest path

4-2. Minimum transfer path

5. Outputs optimal route and estimated time with number of total subway station visits

5-1. Shortest path

5-2. Minimum transfer path

Estimated travel time and estimated transfer time data is available in data folder. The data file format is csv.

• 1지선
• 1호선
• 2지선
• 2호선
• 3호선
• 4호선
• 5지선
• 5호선
• 6호선
• 7호선
• 8호선
• 9호선
• 경의선
• 경춘선
• 공항철도
• 분당선
• 인천1선
• 중앙선
• 역이름
• 환승정보

• Failed to read csv file
• Unavailable or incorrect station name inputted
• Inputted departure station name and destination station name are matching
• Incorrect method inputted