NETWORKS

3. More than one vertex
7. The line that connects the vertices
10. Can be found using the maximum-flow minimum-cut theorem and depends upon the capacity of each edge in the network.
11. A network whose edges have arrows and travel is only possible in the direction of the arrows.
12. Number of edges that are connected to the node.
13. Earliest starting time
14. A group or system of interconnecting objects which can be represented as a diagram of connected lines (called edges) and points (called vertices). For example a rail network.

1. Another name for a vertex
2. Latest starting time
4. The sequence of network activities which combine to have the longest overall duration so as to determine the shortest possible time needed to complete a project.
5. The amount of time that a task in a project network can be delayed without causing a delay to subsequent tasks.
6. An edge of a network diagram that has a number assigned to it which implies some numerical value such as cost, distance or time.
8. States that the flow through a network can not exceed the value of any kind of network and that the maximum flow equals the value of the minimum cut. ie it identifies the bottle neck of the system.
9. A point or dot in a network diagram at which lines of pathways intersect or branch.