L7 - Max Flow Problems Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

What is a graph?

A

A graph consists of vertices [nodes] which are connected by edges [arcs].

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

What is a subgraph?

A

A sub graph is a part of a graph.

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

How is Weighted Graph defined?

A

A graph in which there is a number associated with each edge [its weight].
- also know as a network

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

How is Digraph/Directed edges defined?

A

A graph in which the edges have a direction associated with them – the edges are known as directed edges.
- a directed graph

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

How Degree of Valency/Order defined?

A

The number of edges incident to a vertex.

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

What is a Path?

A

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
7
Q

How is Cycle/Circuit defined?

A

A closed ‘path’ i.e. the end vertex of the last edge is the start vertex of the first edge.

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

How is Connected defined?

A

Two vertices are ‘connected’ if there is a path between them. A graph is connected if all its vertices are connected.

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

How is Loop defined?

A

An edge that starts and finishes at the same vertex.

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

How is Simple Graph defined?

A

A graph in which there are no loops and not more than one edge connecting any pair of vertices.

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

How is Tree defined?

A

A connected graph with no cycles.

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

How is Spanning Tree defined?

A

A subgraph of a graph which includes all 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
13
Q

How is Minimum Spanning Tree defined?

A

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

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

What is capacity utilisation of an arc?

A

is the ratio of the flow on the arc to its maximum capacity

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