Question

6) Below is an adjacency matrix for an undirected graph, size n- 8. Vertices are labeled 1 to 8 Rows are labeled 1 through 8, top to bottom. Columns are labeled 1 through 8, left to right. Column labels to the right: 1 2 345 6 78 Row labels are below this: 1 0 0 1 000 0 0 2 0 0 101 1 00 (See a drippy heart?) 3 1 1 0 1 01 0 0 4 0 0 1 001 0 1 5 0 1 0001 1 0 7 0 0 0 0110 1 8 0 0 0 1 00 1 0 6a) Draw the above graph in the usual way: vertices drawn as circles with the label written inside, and edges drawn as line segments connecting the vertices. Hint: Draw vertex 1 at the top. (Your graph must have all 8 labeled vertices listed above, or no credit.) 6b) Modify the graph from part a, according to a breadth-first search: next to each vertex, label its distance d, and put an arrow on the end of each tree edge pointing from child to parent. When iterating through neighbors, visit in ascending order. Vertex 1 is the source. (A single graph drawn above will answer part a and part b.)

Answer 1

Firstly we create graph and then using Breadth first search algorithm we find parent of each node ant its distance from source node.

In Breadth First Search we add only those neighbours of the dequeued node that are not already been dequeued and not present currently in the queue.

ux MI o 1 1 o 1 means eie Theze 2. 1

6b)

an andl add nelghbours 3 and add Again d ne

一Similar! eand add its meiyhess to here an mo al사

6 3 5 1 2. 2

Hope this helps
If you have any doubt feel free to comment
Thank You!!