Problem B5: Let G be the directed graph below: I Use matrix multiplication to compute the number of length-4 paths (with vertex repetitions allowed) between all pairs of vertices. Represent the final answer by a matrix. Show your work.

Note: Solve the following question and please don't repost previous answers and don't give a computer generated answer.   Problem: Draw a simple, connected, directed, weighted graph with 9 vertices and 17 edges, each with unique edge weights. Identify one vertex as a “start” vertex and illustrate a running of Dijkstra’s algorithm on this graph.

a) write the algorithm  b) Briefly explain why the algorithm solves the problem, and the correctness c ) State and briefly explain the running time of your algorithm

2. Consider the graph given by the following adjacency list: vertex adjacent vertics 1 2, 3, 4 2 1 3 1, 4 4 1, 3 5 - (a) Draw the corresponding graph.    (b) Write down the adjacency matrix A for this graph. Calculate A2. What is the meaning of the entries of matrices A and A2?    (c) Starting at vertex 4, use the adjacency matrix algorithm to check for connectivity. Please no plagiarism and also i want clear hand writting. Thanks

A) Give the adjacency matrix of the graph.  B) Give the depth-first traversal of the graph ().  C)  Give the depth-first traversal of the graph ().

Let G be the following graph with 5 vertises: (4) O Write the incidence matrix of G. O Enter your incidence matrix on for other software) and use it to cakulate +the oumber ofpaths of length 10 stacbing at the vertex 1. How Many of these paths end at vertex 1? vertex 2, 3, 4, and5? Pari

Write the adjacency matrix for the following graphs. b a C d f