![]() ![]() Is the number of lines of Sunday traffic estimates that follow. are lines of live traffic information in the format described below: Is the number of lines of live traffic information that follow. Is a string with the name of the goal location (e.g., StaplesCenter). Is a string with the name of the start location (e.g., JordanHome). Is the algorithm to use and will be one of: “BFS”, “DFS”, “UCS”, “A*”. Your program should write in output.txt the list of intersections/locations traveled over in your solution path, including the starting and finishing locations and the accumulated time from start to that intersection/location, in order of travel. Hence, the input.txt file will also contain Jordan's Sunday traffic estimate of traveling time from each location listed in the file to his destination, which is also an arbitrarily large list of intersections/locations with estimated traveling time (in minutes) from there to StaplesCenter on a traffic-free Sunday. Your program will be given live traffic information in the input.txt file, which is an arbitrarily large list of current traveling times between intersections/locations.īeside live traffic information, Jordan also has an idea of how long it takes on a traffic-free Sunday from each intersection/location to StaplesCenter. You will be required to create a program that finds the fastest route Jordan must travel to get to Staples Center. To accomplish this, you will be given a list of freeway or road intersections (i.e., locations) and the time it would take to travel from there to other freeway or road intersections. Please help Jordan find a route to get him to Staples Center as fast as possible. Driving his 2016 Lamborghini Aventador, Jordan definitely does not want to be stuck in traffic. As everyone knows, Los Angeles is notorious for its traffic. Lakers star Jordan Clarkson wants to arrive earlier today to prepare himself for the game, and he is leaving from his mansion at Newport Coast to Staples Center. The Los Angeles Lakers are playing against their rivals the Boston Celtics tonight. A project which uses various graph traversal algorithms like BFS, DFS, UCS and A* along with loop detection to find a path between two locations on a map ( given in the form of input of road intersections ). ![]()
0 Comments
Leave a Reply. |