Explanation We have to find the shortest path from the vertex A . A = v 1 is given permanent label 0. And all the others are given permanent labels ∞ . And B , H and I have temporary labels decreased to 2, 1 and 8. Then, examine those vertices with temporary labels adjacent to v 2 For J 1 + w ( e ) = 1 + 2 = 3 It is less than its temporary of ∞ , therefore it assigned temporary label of 3. Since, D has the minimum label D ( v 3 ) and assigned as 1. For S 1 + w ( e ) = 1 + 1 = 2 It is less than the temporary label of ∞ therefore it assigned as 2. For H 1 + w ( e ) = 1 + 3 = 4 It is less than its temporary of ∞ , therefore it assigned temporary label of 4. Since, C has the minimum label C ( v 4 ) and assigned as 2. For J 2 + w ( e ) = 2 + 2 = 4 It is greater than its temporary label of 4, therefore no change occurs. Then, examine those vertices with temporary labels adjacent to v 4 For I 2 + w ( e ) = 2 + 2 = 4 It is less than its temporary label of ∞ , therefore it assigned as 4. For H 2 + w ( e ) = 2 + 4 = 6 It is greater than its temporary label of 4 therefore, it remains same. Since, S has the minimum label S ( v 5 ) and assigned as 2. For G 3 + w ( e ) = 2 + 3 = 5 It is less than its temporary label of ∞ therefore, assigned label 5. Examine those vertices with temporary labels adjacent to v 6 For E 2 + w ( e ) = 2 + 2 = 4 It is same as its temporary label of 4. Since J has the minimum label of 3, J ( v 6 ) is assigned label of 3. For K 3 + w ( e ) = 3 + 3 = 6 It is less than its temporary label of ∞ therefore assigned label 6. Since, I has minimum label of 4 I ( v 7 ) therefore, assigned label of 4, Examine those vertices with temporary labels adjacent to v 7 For K 4 + w ( e ) = 4 + 3 = 7 It is greater than its temporary label, therefore it remains same. For L 4 + w ( e ) = 4 + 1 = 5 It is less than its temporary label ∞ therefore it assigned label of 5. Since, H has minimum of 4 H ( v 8 ) and assigned as 4. Examine those vertices with temporary label adjacent to v 8 For G 4 + w ( e ) = 4 + 2 = 6 Which is greater than its temporary label of 5 therefore it assigned label is remain same. Since, E has the minimum label of 4. E ( v 9 ) And assigned permanent label of 4. Examine those vertices with temporary labels adjacent to v 9 For F 4 + w ( e ) = 4 + 1 = 5 It is same as temporary label of 5. Therefore, it assign label same. Since, L has the minimum label of 5 L ( v 10 ) and assigned as 5. Examine those vertices with temporary labels adjacent to v 10 . For G 5 + w ( e ) = 5 + 1 = 6 It is greater than the previously assigned label 5 so, assign remain same

Discrete Mathematics with Graph Theory (Classic Version) (3rd Edition) (Pearson Modern Classics for Advanced Mathematics Series)

3rd Edition

ISBN: 9780134689555

Author: Edgar Goodaire, Michael Parmenter

Publisher: PEARSON

See similar textbooks

Videos

Question

Chapter 10.4, Problem 7E

To determine

The shortest path from A to R every other vertex in the graph and the final labels on all vertices by applying improved version of Dijkstra’s algorithm.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 10.4, Problem 6E

Chapter 10.4, Problem 8E

Students have asked these similar questions

find the value of each variable

Consider the following system of equations, Ax=b : x+2y+3z - w = 2 2x4z2w = 3 -x+6y+17z7w = 0 -9x-2y+13z7w = -14 a. Find the solution to the system. Write it as a parametric equation. You can use a computer to do the row reduction. b. What is a geometric description of the solution? Explain how you know. c. Write the solution in vector form? d. What is the solution to the homogeneous system, Ax=0?

2. Find a matrix A with the following qualities a. A is 3 x 3. b. The matrix A is not lower triangular and is not upper triangular. c. At least one value in each row is not a 1, 2,-1, -2, or 0 d. A is invertible.

Chapter 10 Solutions

Discrete Mathematics with Graph Theory (Classic Version) (3rd Edition) (Pearson Modern Classics for Advanced Mathematics Series)

Ch. 10.1 - Prob. 1TFQ Ch. 10.1 - A path is a walk in which all vertices are...Ch. 10.1 - 3. A trail is a path Ch. 10.1 - A path is trail.Ch. 10.1 - A cycle is a special type of circuit.Ch. 10.1 - 6. A cycle is a circuit with no repeated edges Ch. 10.1 - 7. An Eulerian circuit is a cycle. Ch. 10.1 - Prob. 8TFQ Ch. 10.1 - A sub graph of a connected graph must be...Ch. 10.1 - Prob. 10TFQ

Ch. 10.1 - K8,10 is Eulerian.Ch. 10.1 - Prob. 12TFQ Ch. 10.1 - 13. A graph with more than one component cannot be...Ch. 10.1 - Prob. 1E Ch. 10.1 - [BB] Answer the Konigsberg bridge Problem and...Ch. 10.1 - Prob. 3E Ch. 10.1 - Prob. 4E Ch. 10.1 - Prob. 5E Ch. 10.1 - 6. Suppose we modify the definition of Eulerian...Ch. 10.1 - 7. (a) Is there an Eulerian trail from A to B in...Ch. 10.1 - [BB] (Fictitious) A recently discovered map of the...Ch. 10.1 - 9. Euler’s original article about the Konigsberg...Ch. 10.1 - Prob. 10E Ch. 10.1 - Prob. 11E Ch. 10.1 - [BB] For which values of n1 , if any, is Kn...Ch. 10.1 - 13. (a) Find a necessary and sufficient condition...Ch. 10.1 - Prob. 14E Ch. 10.1 - 15.[BB] Prove that any circuit in the graph must...Ch. 10.1 - Prob. 16E Ch. 10.1 - Prob. 17E Ch. 10.1 - Prob. 18E Ch. 10.1 - Prob. 19E Ch. 10.1 - Prob. 20E Ch. 10.1 - Prob. 21E Ch. 10.1 - Prob. 22E Ch. 10.1 - Prob. 23E Ch. 10.1 - Prob. 24E Ch. 10.1 - 25. Prove that a graph is bipartite if and only if...Ch. 10.1 - Prob. 26E Ch. 10.1 - Prob. 27E Ch. 10.2 - A Hamiltonian cycle is a circuit. Ch. 10.2 - Prob. 2TFQ Ch. 10.2 - Prob. 3TFQ Ch. 10.2 - Prob. 4TFQ Ch. 10.2 - Prob. 5TFQ Ch. 10.2 - A graph that contains a proper cycle cannot be...Ch. 10.2 - Prob. 7TFQ Ch. 10.2 - Prob. 8TFQ Ch. 10.2 - Prob. 9TFQ Ch. 10.2 - Prob. 10TFQ Ch. 10.2 - Prob. 1E Ch. 10.2 - 2. Determine whether or not each of the graphs of...Ch. 10.2 - Determine whether each of the graph shown is...Ch. 10.2 - Prob. 4E Ch. 10.2 - Consider the graph shown. Is it Hamiltonian? Is...Ch. 10.2 - Prob. 6E Ch. 10.2 - Prob. 7E Ch. 10.2 - Does the graph have a Hamiltonian cycle that...Ch. 10.2 - Prob. 9E Ch. 10.2 - Prob. 10E Ch. 10.2 - How many edges must a Hamiltonian cycle is kn...Ch. 10.2 - 12. Draw a picture of a cube, by imagining that...Ch. 10.2 - Prob. 13E Ch. 10.2 - Prob. 14E Ch. 10.2 - Prob. 15E Ch. 10.2 - Prob. 16E Ch. 10.2 - Suppose G is a graph with n3 vertices and at least...Ch. 10.2 - 18.[BB] Suppose G is a graph with vertices such...Ch. 10.2 - Prob. 19E Ch. 10.2 - Prob. 20E Ch. 10.2 - Answer true of false and in each case either given...Ch. 10.2 - Prob. 22E Ch. 10.2 - Prob. 23E Ch. 10.2 - Find a necessary and sufficient condition on m and...Ch. 10.3 - Prob. 1TFQ Ch. 10.3 - Prob. 2TFQ Ch. 10.3 - Prob. 3TFQ Ch. 10.3 - Prob. 4TFQ Ch. 10.3 - Prob. 5TFQ Ch. 10.3 - Prob. 6TFQ Ch. 10.3 - Prob. 7TFQ Ch. 10.3 - Prob. 8TFQ Ch. 10.3 - Prob. 9TFQ Ch. 10.3 - Prob. 10TFQ Ch. 10.3 - Prob. 1E Ch. 10.3 - Prob. 2E Ch. 10.3 - Prob. 3E Ch. 10.3 - Prob. 4E Ch. 10.3 - Prob. 5E Ch. 10.3 - Prob. 6E Ch. 10.3 - Prob. 7E Ch. 10.3 - 8. (a) [BB] Find the adjacency matrices and of...Ch. 10.3 - 9. Repeat Exercise 8 for the graphs and shown....Ch. 10.3 - Prob. 10E Ch. 10.3 - Let A=[abcpqrxyz] and let P=[010001100]. Thus P is...Ch. 10.3 - Prob. 12E Ch. 10.3 - 13. For each pair of matrices shown, decide...Ch. 10.3 - 14. [BB] Let A be the adjacency matrix of a...Ch. 10.3 - Prob. 15E Ch. 10.3 - Prob. 16E Ch. 10.3 - Prob. 17E Ch. 10.3 - Prob. 18E Ch. 10.4 - Prob. 1TFQ Ch. 10.4 - Prob. 2TFQ Ch. 10.4 - It is an open question as to whether there exists...Ch. 10.4 - Prob. 4TFQ Ch. 10.4 - Prob. 5TFQ Ch. 10.4 - Prob. 6TFQ Ch. 10.4 - Prob. 7TFQ Ch. 10.4 - Prob. 8TFQ Ch. 10.4 - Prob. 9TFQ Ch. 10.4 - Prob. 10TFQ Ch. 10.4 - Prob. 1E Ch. 10.4 - Prob. 2E Ch. 10.4 - Prob. 3E Ch. 10.4 - Prob. 4E Ch. 10.4 - Prob. 5E Ch. 10.4 - Prob. 6E Ch. 10.4 - Prob. 7E Ch. 10.4 - Prob. 8E Ch. 10.4 - Prob. 9E Ch. 10.4 - Prob. 10E Ch. 10.4 - Prob. 11E Ch. 10.4 - 12. [BB] Could Dijkstra’s algorithm (original...Ch. 10.4 - Prob. 13E Ch. 10.4 - 14. (a) If weights were assigned to the edges of...Ch. 10.4 - Prob. 15E Ch. 10.4 - Prob. 16E Ch. 10.4 - Prob. 17E Ch. 10.4 - Prob. 18E Ch. 10.4 - Prob. 19E Ch. 10.4 - Prob. 20E Ch. 10.4 - Prob. 21E Ch. 10.4 - Prob. 22E Ch. 10.4 - Prob. 23E Ch. 10.4 - Prob. 24E Ch. 10 - In the Konigsberg Bringe Problem (see fig. 9.1),...Ch. 10 - Prob. 2RE Ch. 10 - Suppose G1 and G2 are graphs with no vertices in...Ch. 10 - Prob. 4RE Ch. 10 - Prob. 5RE Ch. 10 - Is the graph Hamiltonian? Is it Eulerian? Explain...Ch. 10 - Determine, with reason, whether each of the...Ch. 10 - Prob. 8RE Ch. 10 - Prob. 9RE Ch. 10 - Prob. 10RE Ch. 10 - Prob. 11RE Ch. 10 - Prob. 12RE Ch. 10 - Prob. 13RE Ch. 10 - Prob. 14RE Ch. 10 - 15. A connected graph G has 10 vertices and 41...Ch. 10 - Prob. 16RE Ch. 10 - Let v1,v2,........v8 and w1,w2,..........w12 be...Ch. 10 - Prob. 18RE Ch. 10 - Martha claims that a graph with adjacency...Ch. 10 - Prob. 20RE Ch. 10 - Which of the following three matrices (if any) is...Ch. 10 - Apply the first form of Dijkstras algorithm to the...Ch. 10 - Prob. 23RE Ch. 10 - 24. Apply the original form of Dijkstra’s...Ch. 10 - Apply the improved version of Dijkstras algorithm...Ch. 10 - Prob. 26RE Ch. 10 - 27. Apply the Floyd- Warshall algorithm apply to...Ch. 10 - Prob. 28RE

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

The shortest path from A to R every other vertex in the graph and the final labels on all vertices by applying improved version of Dijkstra’s algorithm.

Solution Summary: The author analyzes Dijkstra's algorithm to determine the shortest path from A to R and the final labels on all vertices.

Videos

The shortest path from A to R every other vertex in the graph and the final labels on all vertices by applying improved version of Dijkstra’s algorithm.

Want to see the full answer?

Chapter 10 Solutions