1 Problem Description
A road network is represented using an undirected graph and it contains a set of nodes and edges. Among the nodes, two nodes (must be different) are marked as ‘s’ (source) and ‘d’ (destination). From ‘s’ to ‘d’ there could be multiple possible paths. The edges are labeled with positive integer denoting the distances between two connecting nodes. This graph will be taken as an adjacency matrix from an input file. One or more Electric Vehicles (EVs) will need to travel from node ‘s’ to node ‘d’. For each EV, the following information is needed.
• SOC: denotes the state of the charge of the EV. This is a positive integer and represents the percentage of charge the EV has w.r.t the time.
• Range: denotes the range of the EV. This is again another integer representing the distance the EV can travel when the EV’s SOC is 100%
• Speed: denotes the avg speed of the EV in km/hr. This speed can be used for calculating the time to travel a distance.