ITECWeek.pptVIP

Chapter 12: Graphs ITEC200 – Week 12 Graphs Chapter Objectives To become familiar with graph terminology and the different types of graphs To study a Graph ADT and different implementations of the Graph ADT To learn the breadth-first and depth-first search traversal algorithms To learn some algorithms involving weighted graphs To study some applications of graphs and graph algorithms Graph Terminology A graph is a data structure that consists of a set of vertices and a set of edges between pairs of vertices Edges represent paths or connections between the vertices The set of vertices and the set of edges must both be finite and neither one be empty Visual Representation of Graphs Directed and Undirected Graphs The edges of a graph are directed if the existence of an edge from A to B does not necessarily guarantee that there is a path in both directions A graph with directed edges is called a directed graph A graph with undirected edges is an undirected graph or simply a graph Directed and Undirected Graphs (continued) The edges in a graph may have values associated with them known as their weights A graph with weighted edges is known as a weighted graph Paths and Cycles The Graph ADT and Edge Class Java does not provide a Graph ADT In making our own, we need to be able to do the following Create a graph with the specified number of vertices Iterate through all of the vertices in the graph Iterate through the vertices that are adjacent to a specified vertex Determine whether an edge exists between two vertices Determine the weight of an edge between two vertices Insert an edge into the graph Implementing the Graph ADT Because graph algorithms have been studied and implemented throughout the history of computer science, many of the original publications of graph algorithms and their implementations did not use an object-oriented approach and did not even use abstract data types Two representations of graphs are most common Edges are represented by an array of lists