NETWORKS

5. ,Is an edge of a network diagram that has a number assigned to it which implies some numerical value such as cost, distance or time.
6. ,Is a network whose edges have arrows and travel is only possible in the direction of the arrows.
7. ,More than one vertex
9. ,The amount of time that a task in a project network can be delayed without causing a delay to subsequent tasks.
13. ,Is 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.
14. ,Another name for a vertex

1. ,Depends upon the capacity of each edge in the network.
2. ,The number of edges that are connected to it.
3. ,The line that connects the vertices.
4. ,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.
8. ,states that the flow through a network cannot exceed the value of any cut in the network and that the maximum flow equals the value of the minimum cut, ie it identifies the ‘bottle-neck’ in the system.
10. ,earliest starting time
11. ,A point (or dot) in a network diagram at which lines of pathways intersect or branch.
12. ,latest starting time