Networks Flashcards

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

What is a network?

A

A system of objects, and relationships between them

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

What are nodes?

A

The towns or places

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

What are the edges?

A

The roads between them

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

What are multiple edges?

A

When more than one edge connects to the same pair of nodes

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

What is the degree of the node?

A

The number of edges that end at
that node

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

What is the weight of each edge?

A

The distance between each edge

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

What is a path in a network?

A

A list of edges joined together

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

What is a circuit?

A

A path that starts and ends in the same place

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

What is a tree in terms of networks?

A

A connected network with a unique path and without loops

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

What is a path?

A

An array of edges joined in sequence by nodes

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

What is a Euler path?

A

A network that includes every edge exactly once and traverses the entire graph

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

What is a Euler circuit?

A

A network that passes through every node of the network and each edge only ONCE and RETURNS to its starting vertex.

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

How to work out the minimum spanning tree?

A
  1. Choose the edge with the smallest weight.
  2. Remove the longest edge in each polygon.
  3. Repeat step 2 until all vertices are connected.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

How to do Dijkstra’s Algorithm?

A

Ask sir

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