PPT-Graph Traversal Lecture 18

Graph Traversal Lecture 18 CS 2110 Spring 2019 JavaHyperText Topics Graphs topic 8 DFS BFS 2 Graph Representations 3 0 1 2 3 4 0 F F F F F 1 F F T T F 2 F F F F T 3 F F T F T 4 F F F F F. Jefferson . Amstutz (SURVICE). Johannes . Guenther (Intel). Ingo . Wald (Intel). Christiaan. . Gribble (SURVICE). The Multi-Hit Problem. Objective: find more than one (possibly all) hit point along the ray . *Depth-First-Search(DFS). *Breadth-first-search(BFS). Cody Forrest. Depth & breadth. Depth Breadth. . . | |. A. E. F. G. H. A. G. F. E. I. H. B. B. C. C. D. D. B. B. C. C. What is a graph? . In simple words, . A graph is a set of vertices and edges which connect them.. A node (or vertex) is a discrete position in the graph. . An edge (or connection) is a link between two vertices. Insertion Sort . quick . review. DFS, BFS. Topological Sort. MA/CSSE 473 Day 12. Changes to HW 6 (details: schedule page Day 15). Due date postponed. Problems 9-11 added back in. Questions?. Depth-first Search. Interpolation Search . Insertion Sort . quick review. DFS, BFS. Topological Sort. MA/CSSE 473 Day 12. Questions?. Interpolation Search. Insertion sort analysis. Depth-first Search. Breadth-first Search. A New Data Structure. Data Structures and Algorithms. ACA Summer School 2017. Why Graphs?. For example, given a network of cities and roads connecting them, what is the shortest path between two given cities?. http://courses.cs.washington.edu/courses/cse373. /. Douglas . W. . Harder, U Waterloo. 12/26/03. Graph Terminology - Lecture 13. 2. What are graphs?. Yes, this is a graph….. But we are interested in a different kind of “graph”. Preorder. Traversal. Start at root map. Traverse the left sub-tree. Traverse the right sub-tree. 1. Khan. 2. Jones. 3. Williams. 4. Lee. 5. Roberts. Khan. 1. Jones. 5. Williams. 3. Lee. 4. Roberts. Inorder. Partially adopted from C Plus Data Structure textbook slides. What is a Graph?. Tree:. great for representing hierarchical structures.. each node has only . one. parent.. Graph:. generalization of a tree. We will look at traversals of graphs. Breadth-first or depth-first traversals. Must avoid cycles. Depth-first traversals can be recursive or iterative. Problems that can be solved using traversals. Strategies. Steven Lindell . . Scott Weinstein. 4/4/2017. AMS Special Session. 1. Query theory. Definition. : A . relational. . structure. . S. = 〈. D. ; . R. ₁, …〉 is . a domain . D. with relations . Graph Algorithms Lecture 19 CS 2110 — Spring 2019 JavaHyperText Topics “Graphs”, topics: 4: DAGs, topological sort 5: Planarity 6: Graph coloring 2 Announcements Monday after Spring Break there will be a Data Structures and Algorithms. CSE 373 19 SP - Kasey Champion. 1. Administrivia. We clarified Exercise 5 Problem [] to explicitly mention “worst-case”. CSE 373 SP 18 - Kasey Champion. 2. Administrivia. Data Structures and Algorithms. CSE 373 19 . Sp. - Kasey Champion. 1. Administrivia. HW 7 Due Friday. Final exam review Wednesday 6/5 4-5:50. Final exam next Tuesday!. Double check all grades . Please fill out survey.