0% found this document useful (0 votes)

37 views

CS 106X, Lecture 22 Graphs BFS DFS: Programming Abstractions in C++, Chapter 18

This document discusses graphs, depth-first search (DFS), and breadth-first search (BFS). It begins with a recap of graphs, including definitions of nodes, edges, paths, and various graph properties. It then discusses an example problem of calculating influence on Twitter by analyzing the graph of follower relationships. Next, it introduces DFS as a graph search algorithm before announcing upcoming coverage of BFS. Basic operations and members of the BasicGraph data structure for representing graphs are also listed. The document provides context for algorithms to search graphs for paths between nodes.

Uploaded by

Hari Mandale

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

37 views

CS 106X, Lecture 22 Graphs BFS DFS: Programming Abstractions in C++, Chapter 18

Uploaded by

Hari Mandale

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 80

CS 106X, Lecture 22

Graphs; BFS; DFS

reading:
Programming Abstractions in C++, Chapter 18

This document is copyright (C) Stanford Computer Science and Nick Troccoli, licensed under Creative Commons Attribution 2.5 License. All rights reserved.
Based on slides created by Keith Schwarz, Julie Zelenski, Jerry Cain, Eric Roberts, Mehran Sahami, Stuart Reges, Cynthia Lee, Marty Stepp, Ashley Taylor and others.
Plan For Today
• Recap: Graphs
• Practice: Twitter Influence
• Depth-First Search (DFS)
• Announcements
• Breadth-First Search (BFS)

2
Plan For Today
• Recap: Graphs
• Practice: Twitter Influence
• Depth-First Search (DFS)
• Announcements
• Breadth-First Search (BFS)

3
Graphs
A graph consists of a set of nodes connected by edges.

Graphs can model:

- Sites and links on the web
- Disease outbreaks
- Social networks
- Geographies
- Task and dependency graphs
- and more… 4
Graphs
A graph consists of a set of nodes connected by edges.
Nodes: degree (# connected edges)
Nodes: in-degree (directed, # in-
edges)
Nodes: out-degree (directed, # out-
edges)

Path: sequence of nodes/edges from

one node to another
Path: node x is reachable from node y
if a path exists from y to x.
Path: a cycle is a path that starts and
ends at the same node
Path: a loop is an edge that connects
a node to itself

5
Graphs
A graph consists of a set of nodes connected by edges.
Nodes: degree (# connected edges) 5
Nodes: in-degree (directed, # in-
edges) 3
Nodes: out-degree (directed, # out- 2
edges) 6

Path: sequence of nodes/edges from

1
one node to another 1
Path: node x is reachable from node y
if a path exists from y to x.
Path: a cycle is a path that starts and
ends at the same node
Path: a loop is an edge that connects
a node to itself

6
Graphs
A graph consists of a set of nodes connected by edges.
Nodes: degree (# connected edges) 2
Nodes: in-degree (directed, # in-
edges) 1
Nodes: out-degree (directed, # out- 2
edges) 2

Path: sequence of nodes/edges from

7
Graphs
A graph consists of a set of nodes connected by edges.
Nodes: degree (# connected edges) 3
Nodes: in-degree (directed, # in-
edges) 2
Nodes: out-degree (directed, # out- 0
edges) 4

Path: sequence of nodes/edges from

0
one node to another 0
Path: node x is reachable from node y
if a path exists from y to x.
Path: a cycle is a path that starts and
ends at the same node
Path: a loop is an edge that connects
a node to itself

8
Graphs
A graph consists of a set of nodes connected by edges.
Nodes: degree (# connected edges) A
Nodes: in-degree (directed, # in-
edges) C
Nodes: out-degree (directed, # out- B
edges) D

Path: sequence of nodes/edges from

F
one node to another E
Path: node x is reachable from node y
if a path exists from y to x.
Path: a cycle is a path that starts and
ends at the same node
Path: a loop is an edge that connects
a node to itself

9
Graphs
A graph consists of a set of nodes connected by edges.
Nodes: degree (# connected edges) A
Nodes: in-degree (directed, # in-
edges) C
Nodes: out-degree (directed, # out- B
edges) D

Path: sequence of nodes/edges from

10
Graphs
A graph consists of a set of nodes connected by edges.
Nodes: degree (# connected edges) A
Nodes: in-degree (directed, # in-
edges) C
Nodes: out-degree (directed, # out- B
edges) D

Path: sequence of nodes/edges from

11
Graphs
A graph consists of a set of nodes connected by edges.
Nodes: degree (# connected edges) A
Nodes: in-degree (directed, # in-
edges) C
Nodes: out-degree (directed, # out- B
edges) D

Path: sequence of nodes/edges from

12
Graph Properties
A graph is connected if every node is reachable from every
other node.

13
Graph Properties
A graph is complete if every node has a direct edge to every
other node.

14
Graph Properties
A graph is acyclic if it does not contain any cycles.

15
Graph Properties
A graph is directed if its edges have direction, or
undirected if its edges do not have direction (aka are
bidirectional).

directed undirected

16
Graph Properties
• Connected or unconnected
• Acyclic
• Directed or undirected
• Weighted or unweighted
• Complete

17
Plan For Today
• Recap: Graphs
• Practice: Twitter Influence
• Depth-First Search (DFS)
• Announcements
• Breadth-First Search (BFS)

18
Twitter Influence
• Twitter lets a user follow another user to see their
posts.
• Following is directional (e.g. I can follow you but you
don’t have to follow me back L)
• Let’s define being influential as having a high number
of followers-of-followers.
– Reasoning: doesn’t just matter how many people follow
you, but whether the people who follow you reach a
large audience.

• Write a function mostInfluential that reads a file

of Twitter relationships and outputs the most
influential user.
https://about.twitter.com/en_us/company/brand-resources.html 19
BasicGraph members
#include "basicgraph.h" // a directed, weighted graph
g.addEdge(v1, v2); adds an edge between two vertexes
g.addVertex(name); adds a vertex to the graph
g.clear(); removes all vertexes/edges from the graph
g.getEdgeSet() returns all edges, or all edges that start at v,
g.getEdgeSet(v) as a Set of pointers
g.getNeighbors(v) returns a set of all vertices that v has an edge to
g.getVertex(name) returns pointer to vertex with the given name
g.getVertexSet() returns a set of all vertexes
g.isNeighbor(v1, v2) returns true if there is an edge from vertex v1 to v2
g.isEmpty() returns true if queue contains no vertexes/edges
g.removeEdge(v1, v2); removes an edge from the graph
g.removeVertex(name); removes a vertex from the graph
g.size() returns the number of vertexes in the graph
g.toString() returns a string such as "{a, b, c, a -> b}" 20
Plan For Today
• Recap: Graphs
• Practice: Twitter Influence
• Depth-First Search (DFS)
• Announcements
• Breadth-First Search (BFS)

21
Searching for paths
• Searching for a path from one vertex to another:
– Sometimes, we just want any path (or want to know there is a path).
– Sometimes, we want to minimize path length (# of edges).
– Sometimes, we want to minimize path cost (sum of edge weights).

$50 PVD
$70 ORD
SFO

$2
$130

00
70
$80
$1 LGA
$60

$250 $140
HNL
LAX
$120
100
DFW $110 $
$500 MIA
22
Finding Paths
• Easiest way: Depth-First Search (DFS)
– Recursive backtracking!
• Finds a path between two nodes if it exists
– Or can find all the nodes reachable from a node
• Where can I travel to starting in San Francisco?
• If all my friends (and their friends, and so on) share my post, how many will
eventually see it?

23
Depth-first search (18.4)
• depth-first search (DFS): Finds a path between two vertices by
exploring each possible path as far as possible before backtracking.
– Often implemented recursively.
– Many graph algorithms involve visiting or marking vertices.

Explore all the unvisited
nodes from this node

52
DFS Details
• In an n-node, m-edge graph, takes O(m + n) time with an adjacency
list
– Visit each edge once, visit each node at most once
• Pseudocode:
dfs from v1:
mark v1 as seen.
for each of v1's unvisited neighbors n:
dfs(n)

• How could we modify the pseudocode to look for a specific path?

53
DFS that finds path
dfs from v1 to v2:
mark v1 as visited, and add to path. a b c
perform a dfs from each of v1's
unvisited neighbors n to v2: d e f
if dfs(n, v2) succeeds: a path is found! yay!
if all neighbors fail: remove v1 from path.
g h i

• To retrieve the DFS path found, pass a collection parameter to each

call and choose-explore-unchoose.

54
DFS observations
• discovery: DFS is guaranteed to
find a path if one exists. a b c

d e f
• retrieval: It is easy to retrieve exactly
what the path is (the sequence of g h i
edges taken) if we find it
– choose - explore - unchoose

• optimality: not optimal. DFS is guaranteed to find a path, not

necessarily the best/shortest path
– Example: dfs(a, i) returns {a, b, e, f, c, i} rather than {a, d, h, i}.

55
Plan For Today
• Recap: Graphs
• Practice: Twitter Influence
• Depth-First Search (DFS)
• Announcements
• Breadth-First Search (BFS)

56
Announcements
• Assignment 7 will go out this Friday, is due Wed. after break
– Short graphs assignment (Google Maps!), implementing algorithms
from this week
• Assignment 8 will go out the Wed. after break, is due the last day of
class (Fri)
– Graphs and inheritance assignment (Excel!)

57
Plan For Today
• Recap: Graphs
• Practice: Twitter Influence
• Depth-First Search (DFS)
• Announcements
• Breadth-First Search (BFS)

58
Finding Shortest Paths
• We can find paths between two nodes, but how can we find the
shortest path?
– Fewest number of steps to complete a task?
– Least amount of edits between two words?
• When have we solved this problem before?

59
Breadth-First Search (BFS)
• Idea: processing a node involves knowing we need to visit all its
neighbors (just like DFS)
• Need to keep a TODO list of nodes to process

60
Breadth-First Search (BFS)
• Keep a Queue of nodes as our TODO list
• Idea: dequeue a node, enqueue all its neighbors
• Still will return the same nodes as reachable, just might have
shorter paths

61
BFS

a b c d

e f