D1 Flashcards

(4 cards)

1
Q

What’s a connected graph?

A

When all pairs of vertices connected by a path.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What’s a tree?

A

When there are no cycles

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What’s a spanning tree?

A

When all nodes are connected

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly