CS 206 Introduction to Computer Science II 11 / 11 / 2009 - Veterans Day Instructor: Michael Eckmann.
Published byModified over 6 years ago
Presentation on theme: "CS 206 Introduction to Computer Science II 11 / 11 / 2009 - Veterans Day Instructor: Michael Eckmann."— Presentation transcript:
CS 206 Introduction to Computer Science II 11 / 11 / 2009 - Veterans Day Instructor: Michael Eckmann
Michael Eckmann - Skidmore College - CS 206 - Fall 2009 Today’s Topics Questions? Comments? Graphs –Definitions of terms –Examples of terms –Example uses of graphs –Graph implementations –algorithms
Graphs Graphs consist of a set of vertices and a set of edges. An edge connects two vertices. Edges can be directed or undirected. Directed graphs' edges are all directed. Undirected graphs' edges are all undirected. Directed graphs are sometimes called digraphs. Two vertices are adjacent if an edge connects them. The degree of a vertex is the number of edges starting at the vertex. Two vertices v1 and v2 are on a path if there are a list of vertices starting at v1 and ending at v2 where each consecutive pair of vertices is adjacent.
Graphs The length of a path is the number of edges in the path. A simple path is one whose edges are all unique. A cycle is a simple path, starting and ending at the same vertex. A vertex is reachable from another vertex if there is a path between them. A graph is connected if all pairs of vertices in the graph have a path between them. Example on the board of a connected and an unconnected graph. A complete graph (aka fully connected graph) is a connected graph where all pairs of vertices in the graph are adjacent. Example on the board.
Graphs Connectivity of a digraph –A digraph is strongly connected if there is a path from any vertex to any other vertex (following the directions of the edges) –A digraph is weakly connected if in its underlying undirected graph, there is a path from any vertex to any other vertex Degree of a vertex in a digraph –In-degree of a vertex is the number of edges entering the vertex –Out-degree of a vertex is the number of edges leaving the vertex
Graphs Edges often have a weight associated with them. An edge's weight is some numeric value.
Graphs Can someone define a tree (assuming the nodes are vertices and the edges are undirected) in graph terms?
Graphs Can someone define a tree (assuming the nodes are vertices and the edges are undirected) in graph terms? –Trees are connected graphs without cycles.
Graphs Examples of using graphs to represent real world problems –A weighted graph that connects airports (vertices) and the edges could exist if there is a direct flight between them and the weights might be length of time to travel between the two airports or cost in $ etc.. –A graph whose vertices represent buildings on campus and edges are sidewalks connecting the buildings. –History of computer programming languages (edge from a language that influenced a later language) –Course sequences (signifying all required courses and which are prerequisites for others) for the computer science major at Skidmore. Which are directed, which are undirected? Do any of these have cycles? Do the underlying undirected versions have cycles?
Graphs Examples of using graphs to represent real world problems –Image representation - regions and their spatial relationships where each region is a vertex and edges exist between regions that are adjacent. –and many, many, more...
Graphs Graphs can be represented in programs in many ways. Two common ways to represent them are: –adjacency matrix --- each row number r represents a vertex and the value at column c is true if there's an edge from vertex r to vertex c, false otherwise Notice that the type stored in the adjacency matrix is boolean Could we use this for weighted graphs? Could we use this for directed graphs? –edge lists store a linked list for each vertex, v i items in the list are those vertices v j for which there's an edge from v i to v j
Graphs Graph operations often process vertices and follow edges to other vertices etc. Consider operations that given a vertex, must visit every adjacent vertex, can anyone comment on the positives / negatives in terms of space & time of the two representations? –adjacency matrix –edge lists
Graphs Graph traversal –Breadth first search (BFS) Pick a vertex at which to start Visit all of the adjacent vertices to the start vertex Then for each of the adjacent vertices, visit their adjacent vertices And so on until there are no more adjacent vertices Do not visit a vertex more than once –Only vertices that are reachable from the start vertex will be visited --- example on the board. –The order that vertices in BFS are visited are in increasing order of length of path from starting vertex. –Those that have the same path length from the start vertex can be visited in any order. –Example of BFS on the board.
Graphs Implementation of breadth first search –Need a flag for each vertex to mark it as unvisited, waiting, or visited – so we don't visit vertices more than once. –Keep a queue which will hold the vertices to be visited –Keep a list of vertices as they are visited –BFS algorithm: Mark all vertices as unvisited Initially enqueue a vertex into the queue, mark it as waiting While the queue is not empty –Dequeue a vertex from the queue –Put it in the visited list, mark it as visited –Enqueue all the adjacent vertices that are marked as unvisited to the vertex just dequeued. –Mark the vertices just enqueued as waiting
Graphs Let's see how far we get with implementation of a graph and breadth first search.