1) Draw the following directed graph
G = (V, E)
V = { u, v, w, x, y ,z }
E = { (u,v), (v,w), (w,z), (z,v), (v,y), (x,v), (x,x) }
2) Visually show each step of the DFS algorithm’s execution as done on textbook page 605
3) Create and visually show a (max) heap using the following numbers as shown on textbook page 152.
Numbers: 3, 2, 8, 23, 10, 14, 7, 20, 1, 5, 13, 6, 1
Solution:
Looking for help with your homework?
Grab a 30% Discount and Get your paper done!
