Download presentation

Presentation is loading. Please wait.

Published byDulcie White Modified about 1 year ago

1
Graphs – Searching for Relationships COMP 200 & COMP 130 John Greiner & Stephen Wong

2
Graphs – A Reminder Vertices/nodes + edges connecting vertices Directed Undirected

3
Social graph How are you connected to someone else? Math co-authors, centered on Paul Erdös.

4
Can Introducing Hepocyte Growth Factor Lead to Apoptosis?

5
How are Two Species Related?

6

7
Discovering Your Own Relations 7

8
How to Solve a Maze? 8

9
Solving a Maze: Right-Hand Rule 9 Good when you don’t know the maze layout.

10
How to Get to Work? 10

11
How to Route ?

12
Focus on Three Algorithms Depth-first Search Breadth-first Search Dijkstra’s Shortest Path 12 First, just quick introductions to each.

13
Depth- vs. Breadth-First Search c 2b 2a 3c 4b 3b 3a 4a DFSBFS

14
Dijkstra’s Shortest Path

15
Dijkstra’s Shortest Path ? 3? 4?

16
Dijkstra’s Shortest Path ? 3 4?

17
Dijkstra’s Shortest Path ? 3 4? 8?

18
Dijkstra’s Shortest Path ? 3 4 8?

19
Dijkstra’s Shortest Path ? 3 4 8? 6? 12?

20
Dijkstra’s Shortest Path ? 6? 12?

21
Dijkstra’s Shortest Path ? 6 12?

22
Dijkstra’s Shortest Path ?

23
Dijkstra’s Shortest Path ?

24
Dijkstra’s Shortest Path

25
Dijkstra’s Shortest Path ? 12?

26
Dijkstra’s Shortest Path ? 12

27
Dijkstra’s Shortest Path

Similar presentations

© 2016 SlidePlayer.com Inc.

All rights reserved.

Ads by Google