Use the weighted digraph for problems below:
V = {a, b, c, d, e, f, g, h}
E = {(a,b,6), (a,d,3), (b,c,2), (b,e,5), (c,f,4), (d,e,9), (d,g,1), (e,f,7), (e,g,8), (e,h,2), (f,h,4), (g,h,4)}
(3 pts.) What is the length of the longest path from
a to h? Show the path!
(2 pts.) Does the graph contain a cycle? Justify your
answer!
(3 pts.) Give the adjacency matrix for the graph.
(4 pts.) Provide the order in which nodes would be visited in...