HW5 - Homework 5 Graphs Your submission will be a Word...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Homework 5 Graphs Your submission will be a Word document (.doc) with a filename following the format <FirstName>_<LastName>_ HW5.doc Problem 1: [20] Define the following terms and differentiate between the pairs. Also, draw a figure illustrating each term. a) Directed Graph and Undirected Graph b) Path and Simple Path c) Cycle and Simple Cycle d) Spanning Tree and Minimum Spanning Tree Problem 2: [20] Let G be a graph whose vertices are the integers 1 through 8, and let the adjacent vertices of each vertex be given by the table below: Vertex Vertex Vertex Vertex Adjacent Vertices Adjacent Vertices Adjacent Vertices 1 (2,4) 2 (1,3,4) 3 (2,4) 4 (1,2,3,6) 5 (6,8) 6 (4,5,7) 7 (6,8) 8 (5,7) Assume that, in a traversal of , the adjacent vertices of a given vertex are returned in the same order they are listed in the above table. a) Draw G [4] b) Order the vertices as they are visited in a depth-first traversal starting at vertex 1 [8] c) Order the vertices as they are visited in a breadth-first traversal starting at vertex 1 [8]
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

HW5 - Homework 5 Graphs Your submission will be a Word...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online