cities and stations：Use a map to assign unique IDs to each city and station. This helps in managing the dynamic addition of stations during input parsing.

Railway Lines：For each metro line defined by its start and end stations, add bidirectional edges between consecutive stations. The edges should be weighted based on the distance between the stations and the metro speed (40 km/h).

Walking Connections：After the metro lines are added, connect each station to all other stations (including other metro stations and the start/end points) with walking edges. Walking speed is 10 km/h.

Edge Weights：

• Metro Edges: Time is calculated as distance / 40 (converted to hours).
• Walking Edges: Time is calculated as distance / 10 (converted to hours).

Graph Initialization：

• Use a vector of edge structures to store the graph. Each edge contains the destination node and the travel time.
• Use a bitset to track visited nodes and a priority queue for Dijkstra's algorithm.

Input Parsing：

• Parse the home and school coordinates.
• Read each metro line's stations and add edges for each consecutive pair.
• Add walking edges between all pairs of nodes.

Dijkstra's Algorithm：

• Initialize the travel times from home to all other nodes as infinity.
• Use a priority queue to always expand the node with the smallest current travel time.
• For each node, update the travel times of its neighbors and push them into the priority queue if a shorter path is found.

Output：

• The time taken to reach the school node multiplied by 60 gives the total travel time in minutes.