Routers and routes

B is an

• Node

• Edge

• Weight

• Cost

EC is an

• Vertex

• Edge

• Weight

• Graph

The weight of HF is

• 3

• GE

• 6

• D

A list of steps that you can follow to finish a task

• Program

• Event

• Conditionals

• Algorithm

In graph theory, the difference between a tree and a cycle is

• A tree is a plant; a cycle is a machine.

• If you follow the edges of a cycle forward, you can end up at the same place. Can't do that with a tree.

• A tree is cheaper than a cycle.

• Node of a tree are all adjacent unlike a cycle.

A tree is spanning if:

• its edges connect every node.

• the set of edges is the most expensive.

• the vertices can be connected in alphabetical order.

• the sum of the weights is the least possible.

The number of vertices in a tree with 12 edges is 

• 10
• 11
• 12
• 13

The MST problem is not useful for planning:

• telephone lines

• router networks

• roads

• gardens