Purchase Solution

Graph to tree for breadth and depth first search tree

Not what you're looking for?

Ask Custom Question

Hi. We have been asked to do the following with a given graph (will be uploaded "cgraph.jpg")

1. Depth first tree
2. Breath first tree

I know now do to a depth first search and breath first search, but not a tree (I don't even know what it is asking). I'm assuming we are to somehow put it in tree form.
(This is to be written on paper, not used in program).

These are my results from the
depth first search: ABCDEF
breath first search: ABFCDE

I didn't post my steps however I know depth first uses stack and breath first uses queue.
I just need to be shown how to make them "trees" (on paper).

Attachments
Purchase this Solution
Solution Summary

This problem describes on paper how to convert a graph into a tree, and search breadth first and depth first.

Solution Preview

To convert the given graph into a tree, you cut links C to F and C to E (see attachment).

For Breadth search, traverse left to right at every level.
For given problem:
Level 1: A
Level 2: left: B, right : F
Level 3: C
Level ...

Solution provided by:
Amrit Lal Ahuja, PhD (IP)
Education
  • BEng, Allahabad University, India
  • MSc , Pune University, India
  • PhD (IP), Pune University, India
Recent Feedback
  • " In question 2, you incorrectly add in the $3.00 dividend that was just paid to determine the value of the stock price using the dividend discount model. In question 4 response, it should have also been recognized that dividend discount models are not useful if any of the parameters used in the model are inaccurate. "
  • "feedback: fail to recognize the operating cash flow will not begin until the end of year 3."
  • "Answer was correct"
  • "Great thanks"
  • "Perfect solution..thank you"
Purchase this Solution
Free BrainMass Quizzes
Basic UNIX commands

Use this quiz to check your knowledge of a few common UNIX commands. The quiz covers some of the most essential UNIX commands and their basic usage. If you can pass this quiz then you are clearly on your way to becoming an effective UNIX command line user.

Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.

Inserting and deleting in a linked list

This quiz tests your understanding of how to insert and delete elements in a linked list. Understanding of the use of linked lists, and the related performance aspects, is an important fundamental skill of computer science data structures.

Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.

Javscript Basics

Quiz on basics of javascript programming language.

View More Free Quizzes
Related BrainMass Solutions

  • Graph Theory -Tree and Tree Structures

    b) Please refer to the attachment. c) Depth-first search and Breadth first search are both algorithms used for searching a tree, tree structure, or a graph.

  • Graph Problem with Depth First Search and Breadth First Search

    66542 Graph Problem with Depth First Search and Breadth First Search Let G = (V, E) be a connected and undirected graph, and u is a chosen vertex in V.

  • Vertices, Nodes, Breadth-first Search Algorithm and Rooted Trees

    128938 Vertices, Nodes, Breadth-First Search Algorithm and Rooted Trees 1. Use the breadth first search algorithm to find a spanning tree for the following connected graph.

  • Graphs and B-Tree

    The number 18 will be down to the block that contains 19, 21. The resulted block is 18, 19, 21 This solution uses breadth-first traversal and depth-first traversal to determine a path diagram for the nodes and also predicts changes to the B-tree.

  • Undirected Graph, Spanning Tree, Joining Nodes and Ancestors

    55997 Undirected Graph, Spanning Tree, Joining Nodes and Ancestors Let G be an undirected graph, and let T be the spanning tree genereted by a depth-first search of G.

  • Depth First Numbering

    359710 Depth First Numbering Apply the depth-first search algorithm to the graph (in the attachment) to find the depth-first search numbering. Then color the tree edges (blue for example) and the back edges (black for example).

  • Graph Theory and Parse Tree

    What might be the significance of the depth and breadth of a parse tree relative to the sentence it represents? If you need to, look up parse tree and natural language processing on the Internet to see some examples.

  • Trees

    127752 Tree Graphs and Minimal Spanning Trees 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.

  • Graphical Characteristics

    A (c) If we want to visit all vertices by breadth-first search in both graph A and B, then for graph A, we can start at vertex E and get E A B D C F For graph B, we can start at vertex A and get A B D F C E (d) In graph B, if we start a breadth-first

View More Related Solutions