Download presentation

Presentation is loading. Please wait.

Published byLetitia Harvey Modified about 1 year ago

1
Graph Theory ITEC 320 Lecture 21

2
Graph Theory Review Higher level usage of pointers –Factories –Flyweight –Disk pool Rationale Benefits / Downsides

3
Graph Theory Outline Rationale Definition Methods of implementation Algorithms

4
Graph Theory Cell phones How do they work (communication side)

5
Graph Theory Cell Networks

6
Graph Theory Other scenarios Computer networks Google maps Facebook friends Gaming

7
Graph Theory Rationale How do you model a cell phone network on a computer? Why would you want to simulate a cell phone network?

8
Graph Theory Graphs Composed of vertices and edges Vertices –Represent an object in a graph Edges –A connection between two vertices

9
Graph Theory Variations Weighted graph –Toll road –Hotel cost –Identifiers Possible usage scenarios?

10
Graph Theory Methods of implementation Arrays Pointers Benefits of each approach Downsides of each approach

11
Graph Theory Code Should we use a package? What about generics?

12
Graph Theory Searching How do you find information in a graph? Destination Start

13
Graph Theory Breadth first For each node I am connected to –Is this the node I’m looking for? If I didn’t find it –For each node I am connected to Call breadth first search on it

14
Graph Theory Depth first If I am the node searched for, stop and return For each node I am connected to –Call depth first search on that node

15
Graph Theory Issues What are some of the issues that might happen with searching? How do you implement each way? –Stacks / Recursion / Packages / ?

16
Graph Theory More How do you pick the best path? –Lowest cost –Highest cost –Cover all points with least overlap

17
Graph Theory Summary Rationale for graph theory Approach Finding algorithms

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google