Trees_Part_1

# Trees_Part_1 - Trees Chapter 7 CSE 2011 Prof J Elder-1 Last...

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

Last Updated: 12-01-24 11:27 AM CSE 2011 Prof. J. Elder - 1 - Trees Chapter 7

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

View Full Document
Last Updated: 12-01-24 11:27 AM CSE 2011 Prof. J. Elder - 2 - Graph a c b Node ~ city or computer Edge ~ road or data cable Undirected or Directed A surprisingly large number of computational problems can be expressed as graph problems.
Last Updated: 12-01-24 11:27 AM CSE 2011 Prof. J. Elder - 3 - Directed and Undirected Graphs (c) The subgraph of the graph in part (a) induced by the vertex set {1,2,3,6}. (a) A directed graph G = ( V, E ), where V = {1,2,3,4,5,6} and E = {(1,2), (2,2), (2,4), (2,5), (4,1), (4,5), (5,4), (6,3)}. The edge (2,2) is a self-loop. (b) An undirected graph = ( V,E ), where = {1,2,3,4,5,6} and = {(1,2), (1,5), (2,5), (3,6)}. The vertex 4 is isolated.

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

View Full Document
12-01-24 11:27 AM CSE 2011 Prof. J. Elder - 4 - Trees Tree Forest Graph with Cycle A tree is a connected , acyclic , undirected graph.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 8

Trees_Part_1 - Trees Chapter 7 CSE 2011 Prof J Elder-1 Last...

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

View Full Document
Ask a homework question - tutors are online