D1 Flashcards

1
Q

What is a graph?

A

A set of vertices connected by arcs.

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

What is the weight of an arc?

A

The number/length associated with the arc.

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

What is the degree/valency of a vertex?

A

The number of arcs connected to it.

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

What is a path?

A

A sequence of arcs leading from one vertex to another in which no vertex is repeated.

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

What is a cycle?

A

A closed path between vertexes.

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

When is are two vertices connected?

A

If there is an arc between them.

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

When is a graph connected?

A

When all of the vertices are connected.

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

What is a directed edge?

A

An arc with a direction associated to it.

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

What is a tree?

A

A connected graph with no cycles.

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

What is a spanning tree?

A

A subgraph that includes all of the vertices of the graph and is also a tree.

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

What is a complete/connected graph?

A

A graph in which all of the vertices are connected to each other.

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

What is a bipartite graph?

A

A graph consisting of two sets of vertices, X & Y. Arcs can only join between the groups not within them.

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

What is a matching?

A

The pairing of some elements in a bipartite graph.

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

What is a complete matching?

A

When all of the elements are paired.

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

What is a subgraph?

A

A graph whose vertices belong to a larger graph.

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

What is a minimum spanning tree?

A

A spanning tree such that the total length of its arcs is as small as
possible

17
Q

How do you use Kruskal’s Algorithm?

A
  • Choose shortest edge

- Choose next shortest edge that doesn’t form cycle. (reject etc)

18
Q

How do you use Prim’s Algorithm?

A
  • Choose vertex

- Choose shortest edge from vertex to vertex not in network

19
Q

Give three differences between Prim’s and Kruskal’s.

A
  • Prim starts with vertex, Kruskal with edge.
  • Prim goes along nodes, Kruskal steps independent.
  • Prim’s must have connected graph.