D1 Flashcards
(4 cards)
1
Q
What’s a connected graph?
A
When all pairs of vertices connected by a path.
2
Q
What’s a tree?
A
When there are no cycles
3
Q
What’s a spanning tree?
A
When all nodes are connected
4
Q
What’s a path?
A
A path is a finite sequence of edges, such that the end vertex of one edge in the sequence is the start vertex of the next, and in which no vertex appears more than once.
