D1 Definitions and Key Points:

Chapter 1: First-fit First-fit decreasing Full-bin 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.

Difficult to do, especially when lots of numbers or awkward numbers are involved.

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

A graph consists of vertices [nodes] which are connected by edges [arcs]. A subgraph is a part of a graph. A graph in which there is a number associated with each edge [its weight]. The number of edges incident to a vertex. A finite sequence of edges, such that the end vertex of one edge in the sequence is the start vertex of the next, and in which no vertex appears more than once. A path in which you are permitted to return to vertices more than once. A closed path i.e. the end vertex of the last edge is the start vertex of the first edge. Two vertices are connected if there is a path between them. A graph is connected if all its vertices are connected. An edge that starts and finishes at the same vertex. A graph in which there are no loops and not more than one edge connecting any pair of vertices. A graph in which the edges have a direction associated with them the edges are known as directed edges. A connected graph with no cycles. A subgraph of a graph which includes all the vertices of the graph and is also a tree. A graph consisting of two sets of vertices, X and Y. The edges only join vertices in X to vertices in Y, not vertices within a set. A graph in which every vertex is directly connected by an edge to each of the other vertices. If the graph has n vertices, the connected graph is denoted kn. A graph in which there are r vertices in set X and s vertices in set Y [denoted kr,s]. A graph showing the same information as another but which is drawn differently. A matrix which records the number of direct links between vertices. A matrix which records the weights on the edges. Where there is no weight, this indicated by -.

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.

The purpose of dummies: 1. E.g. If activity D depends only on activity B but activity E depends on activities B and C. 2. To enable the unique representation of activities in terms of their end events. Chapter 6: Chapter 7: Matching Maximal matching Complete matching Alternating path A matching is the 1 to 1 pairing of some, or all, of the elements of one set, X, with elements of a second set, Y, in a bipartite graph. A matching in which the number of arcs is as large as possible. A complete matching is the 1 to 1 pairing of all of the elements of one set, X, with elements of a second set, Y, in a bipartite graph. A path starting at an unmatched node on one side of the bipartite graph and finishes at an unmatched node on the other side. It uses arcs that are alternately not in or in the initial matching.