1. Perform a depth-first search of the Australia digraph given below, starting at Sydney. List the order in which the cities are processed. - Do the same for a breadth-first search.

icon
Related questions
Question

this is for my data structure class please provide me with the complete code and the output thank you 

1. Perform a depth-first search of the Australia digraph given below,
starting at Sydney. List the order in which the cities are processed.
- Do the same for a breadth-first search.
Perth
CSC 236 Lab 7 (2 programs) graphs
15
Darwin
4
Black
Stump
3
Adelaide
2
Melbourne
Canberra
2. Consider the graph below. Write a program that outputs the shortest
distance from node O to every other node in the graph.
3
8
Fly Crocodile Airlines
Each
Hobart
12
Brisbane
Sydney
Transcribed Image Text:1. Perform a depth-first search of the Australia digraph given below, starting at Sydney. List the order in which the cities are processed. - Do the same for a breadth-first search. Perth CSC 236 Lab 7 (2 programs) graphs 15 Darwin 4 Black Stump 3 Adelaide 2 Melbourne Canberra 2. Consider the graph below. Write a program that outputs the shortest distance from node O to every other node in the graph. 3 8 Fly Crocodile Airlines Each Hobart 12 Brisbane Sydney
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 3 images

Blurred answer