Consider the following undirected graph, which is given in adjacency matrix form
ID: 3690842 • Letter: C
Question
Consider the following undirected graph, which is given in adjacency matrix form and where vertexes have character labels and edges have non-negative integer weights (no value indicates no edge exists): List the node(s) that have a degree of 4. Trace Dijkstra's algorithm starting at node E by completing the table started below where each row represents one iteration of the algorithm. What is the shortest path from E to A? Give a list of vertexes starting at E and ending at A. What is the shortest path from E to A? Give a list of vertexes starting at E and ending at G.Explanation / Answer
A)the nodes that have the degree of 4 are A,C,D
C)The shotest path from E to A is 7 the path is E->D->A=3+4=7
D)The shotest path from E to G is 9 the path is E->B->G