Introduction to Graph Theory Instructor: Dr. Chaudhary Department of Computer Science Millersville University Reading Assignment Chapter 1.
1 Graphs - Definitions - Breadth First Search - Depth First Search - Connectivity - Topological Ordering.
CSCI 256 Data Structures and Algorithm Analysis Lecture 4 Some slides by Kevin Wayne copyright 2005, Pearson Addison Wesley all rights reserved, and some.
3.1 Basic Definitions and Applications. Undirected Graphs Undirected graph. G = (V, E) V = nodes. E = edges between pairs of nodes. Captures pairwise.
3.1 Basic Definitions and Applications. 2 Undirected Graphs Undirected graph. G = (V, E) n V = nodes. n E = edges between pairs of nodes. n Captures pairwise.
