exam_graphslol-1 copy

# exam_graphslol-1 copy - I-55 = violeta I-66 = rojo b List...

This preview shows pages 1–4. Sign up to view the full content.

aA a b c d e f g h 6 1 7 A C B 6 E 1 9 G F D COMP 2502: DISCRETE COMPUTATIONAL STRUCTURES  II Exam  II Name: Date: __________________ Solve: 1. Seven towns a, b, c, d, e, f, and g are connected by a system of highways as  follows:  (15 pts) I-22  goes from  a  to  c  passing through  b ; I-33 goes from  c  to  and then passes through  b  as it continues to  ; I-44 goes from  d  to  e  to  a ; I-55 goes from  f  to  passing through  ; I-66 goes from  g  to  d . a) Using vertices for towns and directed edges for segments of highways between  towns draw a directed graph that models this situation. A                          B                             C F                       G        D        E I-22  = azul I-33 = verde I-44 = anaranjado

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

View Full Document

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: I-55 = violeta I-66 = rojo b) List the paths from g to a . G → B → A G → F → B → A G → D → E → A G → D → B → A G → D → C → B → A 2. Determine the adjacency matrix for the graph. (5 pts) a b c d e f g h a 1 1 1 1 1 b 1 1 1 1 1 c 1 1 1 1 1 d 1 1 1 1 1 e 1 1 1 1 1 f 1 1 1 1 1 g 1 1 1 1 1 h 1 1 1 1 1 Determine the number of connected components for the graph with the following adjacency matrix : (5 pts)...
View Full Document

## This note was uploaded on 04/27/2010 for the course CS 2502 taught by Professor Luisrod during the Spring '10 term at Bayamon Central.

### Page1 / 4

exam_graphslol-1 copy - I-55 = violeta I-66 = rojo b List...

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

View Full Document
Ask a homework question - tutors are online