Purchase Solution

Trees

Not what you're looking for?

Ask Custom Question

1.Use the depth-first search numbering obtained in the indicated exercise to list the back edges in the graph. Use the file (5.3jpg)

2. Use Prim's algorithm to find a minimal spanning tree for each weighted graph. (Start at A) Give the weight of the minimal spanning tree found Use 5.2prims.jpg

Purchase this Solution

Solution Summary

This shows how to list back edges in a graph and find minimal spanning trees for weight graphs. The expert uses the depth-first search numbering obtained in the indicated exercise to list the back edges in the graph.

Solution Preview

1. 5.3.jpg
By depth-first search, we obtain the nodes as follows.
A->C->H->F->I->K->G->L->J->D, then the edge (D,G) is a back edge
Then G->B, then the edges (B,C), (B,F) are back edges
Then (G,I) is a back edge.
Then B->E, and (E,A) is a back edge.
So in this DFS tree, (D,G), (B,C), (B,F), ...

Purchase this Solution


Free BrainMass Quizzes
Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Probability Quiz

Some questions on probability

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.