Java Use the graph below for the next four questions. Use alphabetic ordering fo

Question

Java

Use the graph below for the next four questions.

Use alphabetic ordering for the order in which neighbors are visited. (For example, if the neighbors are A, C, and E, you would visit them in the order A, C, then E.)

To write your answer, write the vertices in the traversal order without spaces or commas (e.g., ABCDEFG).

1. Trace a breadth-first traversal starting at vertex N.

2. Trace a breadth-first traversal starting at vertex A.

3. Trace a depth-first traversal starting at vertex N

4. Trace a depth-first traversal starting at vertex A.

Explanation / Answer

1)NGPHXQWMA

2)AMWQXPGNA

3)NGHPXWQMA

4)AMQWXGPNH

Explanation:

Breadth First Traversal

step 1 Go to the adjacent vertex. It must be marked as visited. It must be displayed and inserted in the queue.

step 2 If you do nof find any adjacent vertex, the first vertex must be removed from the queue.

step 3 go to step 1 until all the vertices are visited.

Depth First Traversal

step 1 Go to the adjacent vertex. It must be marked as visited. It must be displayed and pushed on to the stack.

step 2 If you do not find any adjacent vertex, the vertex must be poped up.

step 3 go to step 1 until all the vertices are visited.

Related Questions

Navigate

• Browse (All)
• Browse J
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.