'Inverse adjacency list' presentation slideshows

CSCI2100B Graph Jeffrey Yu@CUHK

827 views • 66 slides

DATA STRUCTURE

DATA STRUCTURE. Instructor: Dai Min Office: XNA602 Fall 2006. CHAPTER 4 Graphs. Basic terminology Graph Implementation Graph Traversals Minimal Cost Spanning Tree Shortest Path Problem. 4. 1 Graphs. 1) Definition A graph G consists of two sets

980 views • 65 slides

Shortest Paths (1/11)

Shortest Paths (1/11). In this section, we shall study the path problems such like Is there a path from city A to city B? If there is more than one path from A to B, which path is the shortest?. 45. 50 10. V 0. V 1. V 4. 20 10 15 20 35 30. 15 3.

397 views • 30 slides