Professional Documents
Culture Documents
D1 Definitions and Key Points
D1 Definitions and Key Points
Chapter 1:
First-fit
First-fit
decreasing
Full-bin
Chapter 2:
Graph
Subgraph
Weighted graph
Degree of
valency/order
Path
Walk
Cycle/circuit
Connected
Loop
Simple graph
Digraph/Directed
edges
Tree
Spanning tree
Bipartite graph
Complete graph
Complete bipartite
graph
Isomorphic graphs
Adjacency matrix
Distance matrix
Advantage
Quick to do.
Usually a good
solution.
Easy to do.
Usually a good
solution.
Disadvantage
Not likely to lead to a good solution.
May not get an optimal solution.
Chapter 3:
Minimum spanning tree [MST]: A spanning tree such that the total length of its arcs is as small
as possible.
Differences between Kruskals and Prims Algorithm:
1. Kruskals algorithm always starts with the arc of lowest weight while Prims can start at any
node.
2. Kruskals algorithm produces a MST in a chaotic manner while Prims MST grows with
linked arcs.
3. Unlike Kruskals algorithm, you do not have to check for cycles with Prims algorithm.
4. Prims algorithm can be applied to a distance matrix while Kruskals algorithm cannot.
Chapter 4:
Eularian graph: All the valencies are even. The graph is traversable.
Semi-Eularian graph: If precisely two valencies are odd and rest are even. The graph is semitraversable.
Key Question: Explain why there must always be an even [or zero] number of vertices with odd
valency in every graph.
Answer:
Each arc has two ends and so will contribute to two to the total sum of the valencies of the
whole graph.
Therefore, the sum of the valencies is always even.
Therefore, vertices with an odd number of valencies must exist in pairs.
Therefore, there is always an even number of odd valencies.
Chapter 5:
Early event
time
Late event
time
Critical
activity
Critical path
Total float
The earliest time of arrival at the event allowing for the completion of al
preceding activities.
The latest time that the event can be left without extending the time needed for
the project.
An activity where any increase in its duration results in a corresponding increase
in the duration of the whole project i.e. it has a total float of zero.
A path from the source node to the sink node which entirely follows critical
activities. It is the longest path contained in the network.
The amount of time an activity may be delayed without affecting the duration of
the project.