9. Graphs Connected - 8/27/09 11 8/27/09 MATH 224 Discrete...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon

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

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

Unformatted text preview: 8/27/09 11 8/27/09 MATH 224 Discrete Mathematics 1 2 3 4 5 6 1 1 1 1 1 2 1 3 1 4 1 1 1 5 1 1 1 1 6 1 First we determine if a graph is connected using a breadth first algorithm. Start with a row and find all nodes connected by one edge. Then determine all nodes connected to those nodes and so on until we cover all edges or have exhausted all options. Determining if a Graphs is Connected-1-1-1-1-1-1 index 1 2 3 4 5 6 starting with node 1 8/27/09 22 8/27/09 MATH 224 Discrete Mathematics 1 2 3 4 5 6 1 1 1 1 1 2 1 3 1 4 1 1 1 5 1 1 1 1 6 1 Determining if a Graphs is Connected 1-1-1 1 2-1 index 1 2 3 4 5 6 starting with node 1 then to node 0 and 4 adding node 5 from 0 8/27/09 33 8/27/09 MATH 224 Discrete Mathematics 1 2 3 4 5 6 1 1 1 1 1 2 1 3 1 4 1 1 1 5 1 1 1 1 6 1 Determining if a Graphs is Connected 1-1 2 1 2-1 index 1 2 3 4 5 6 starting with node 1 then to node 0 and 4 adding node 5 from 0 adding 3 from 4 8/27/09 44 8/27/09 MATH 224 Discrete Mathematics 1 2 3 4 5 6 1 1 1 1 1 2 1 3 1 4 1 1 1 5 1 1 1 1 6 1 Determining if a Graphs is Connected...
View Full Document

Page1 / 11

9. Graphs Connected - 8/27/09 11 8/27/09 MATH 224 Discrete...

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

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