SophiaPretty

(5)

$14/per page/Negotiable

About SophiaPretty

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Applied Sciences,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Economics,Engineering,English,Environmental science,Essay writing Hide all
Teaching Since: Jul 2017
Last Sign in: 304 Weeks Ago, 3 Days Ago
Questions Answered: 15833
Tutorials Posted: 15827

Education

  • MBA,PHD, Juris Doctor
    Strayer,Devery,Harvard University
    Mar-1995 - Mar-2002

Experience

  • Manager Planning
    WalMart
    Mar-2001 - Feb-2009

Category > Computer Science Posted 13 Dec 2017 My Price 10.00

program that finds the driving direction of a specified

Topic: Graph and Sorting algorithms.

Finding direction.

You are to write a program that finds the driving direction of a specified initial and end

location much like MapQuest. 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 streets

may be one-ways. The text file will look like:

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:

1. Write a function to perform a quick sort on a list of alphanumeric data.

2. 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.

3. Sort the list using the Quick Sort or Merge Sort algorithm

4. Copy the names from the sorted list into the graph. Omit duplicates.

5. Create the graph by reading the file and adding an edge for each street. Use a binary

search to find the proper vertex.

6. In the main program ask the user to input a start and end intersection.

7. 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 MPH.

You should have at least 20 intersections and 30 roads. You may share map files with

other students. In fact if you thing 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 MPH. The Graph array should include the intersection name and the pointer to

the linked list.

Attachments:

Answers

SophiaPretty
(5)
Status NEW Posted 13 Dec 2017 12:12 PM My Price 10.00

-----------  ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly

Not Rated(0)