CS 1D Assignment 11 DFS and BFS Directed Edges solution

$24.99

Original Work ?
Category: You will Instantly receive a download link for .ZIP solution file upon Payment

Description

5/5 - (5 votes)

Part A
Develop software to perform a DFS starting at Denver (always
choose the edge with the smallest mileage). Identify the
discovery edges, forward, back edges, and cross edges. What is
the total distance travelled?
Part B
Develop software to perform a BFS starting at Denver (always
choose the edge with the smallest mileage). Identify the
discovery edges, back edges, forward, and cross edges. What is
the total distance travelled?
Part C
Is the graph strongly connected? Why?
Work with a different partner from your project 2 team.
Due April 15th
Seattle
San Francisco
Los Angeles
807
381
Chicago
Boston
New
York
Atlanta
Houston Miami
Dallas
Kansas City
Denver
2097
1015
1003
983
214
888
661
1187 239
496
533
1331
1267
1435
1663
599
787
1260
864
781
810
Assignment 11