Homework 3 Graph and sorting algorithms You are to write a program that finds the driving direction of a specified initial and end location much like MapQuest or Google Maps. You are to read the map information from a text file and create a graph. Each intersection and point of interest in the map will be given a unique name and be a vertex in the graph. Each road connecting 2 intersections is an edge in the graph. The edge names do not need to be unique. Use a directional graph since some streets may be one-ways. The text file will look like:
Homework 3 Graph and sorting algorithms You are to write a program that finds the driving direction of a specified initial and end location much like MapQuest or Google Maps. You are to read the map information from a text file and create a graph. Each intersection and point of interest in the map will be given a unique name and be a vertex in the graph. Each road connecting 2 intersections is an edge in the graph. The edge names do not need to be unique. Use a directional graph since some streets may be one-ways. The text file will look like: Intersection Street Intersection Speed Name Name Name Direction Distance Limit Alafaya&GeminiN Gemini Gemini&GreekParkCt East .3 35 Gemini&GreekParkCt Gemini Alafaya&GeminiN West .3 35 Gemini&GreekParkCt Gemini Gemini&KnightCtE East .5 35 Gemini&KnightCtE Gemini Gemini&GreekParkCt West .5 35 Gemini&KnightCtE KnightCt Arena North .1 20 Arena KnightCt Gemini&KnightCtW South .1 20 Steps: Write a function to perform a Quick Sort or Merge Sort on a list of alphanumeric data. Read the text file and add each intersection name to the list. Only read the first column since all intersection names will be in there. Sort the list using the Quick Sort or Merge Sort algorithm Copy the names from the sorted list into the graph. Omit duplicates. Create the graph by reading the original map file and adding an edge for each street. Use a binary search algorithm to find the proper vertex in the graph. In the main program ask the user to input a start and end intersection. Find the shortest and quickest path from the start to the end intersection. The output should indicate the name of the street and the distance. The output should look like: From Alafaya&GeminiN Take Gemini East to Gemini&GreekParkCt .3 Take Gemini East to Gemini&KnightCtE .5 Take KnightCt North to Arena .1 The shortest path is the path with the least mileage while the fastest path is the path with the least time. The time is the distance multiplied by the speed in MPH. You should have at least 20 intersections and 30 roads. You may share map files with other students. In fact, if you think you have a good map file allow me to have a copy for future students. Hint the node structure for the graph should include the street name, direction like East, dist, and speed. The Graph array should include the intersection name and the pointer to the linked list.
Why Work with Us
Top Quality and Well-Researched Papers
We always make sure that writers follow all your instructions precisely. You can choose your academic level: high school, college/university or professional, and we will assign a writer who has a respective degree.
Professional and Experienced Academic Writers
We have a team of professional writers with experience in academic and business writing. Many are native speakers and able to perform any task for which you need help.
Free Unlimited Revisions
If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document. You can do this yourself after logging into your personal account or by contacting our support.
Prompt Delivery and 100% Money-Back-Guarantee
All papers are always delivered on time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.
Original & Confidential
We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text. We also promise maximum confidentiality in all of our services.
24/7 Customer Support
Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.
Try it now!
How it works?
Follow these simple steps to get your paper done
Place your order
Fill in the order form and provide all details of your assignment.
Proceed with the payment
Choose the payment system that suits you most.
Receive the final file
Once your paper is ready, we will email it to you.
No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.
No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.
Admission Essays & Business Writing Help
An admission essay is an essay or other written statement by a candidate, often a potential student enrolling in a college, university, or graduate school. You can be rest assurred that through our service we will write the best admission essay for you.
Our academic writers and editors make the necessary changes to your paper so that it is polished. We also format your document by correctly quoting the sources and creating reference lists in the formats APA, Harvard, MLA, Chicago / Turabian.
If you think your paper could be improved, you can request a review. In this case, your paper will be checked by the writer or assigned to an editor. You can use this option as many times as you see fit. This is free because we want you to be completely satisfied with the service offered.