10.4 Connectivity Flashcards
1
Q
Define path
A
Informally, a path is a sequence of edges that begins at a vertex of a graph and travels from vertex to vertex along edges of the graph. As the path travels along its edges, it visits the vertices along this path, that is, the endpoints of these edges.
2
Q
Path Example
A
3
Q
Degrees of Separation
A
4
Q
Erdős numbers
A
5
Q
Bacon Numbers
A
6
Q
Define connected vs disconnected
A
7
Q
Define connected component
A
8
Q
Define strongly connected vs weekly connected
A
9
Q
Define strongly connected components
A
10
Q
The Connected Components of the Web Graph
A
11
Q
Define Cut Vertices and Cut Edges
A
12
Q
Cut Vertices and Cut Edges Example
A
13
Q
The Definition of Matrix Multiplication
A
14
Q
Counting Paths between Vertices Therem
A
15
Q
Counting Paths between Vertices Example
A
