D1 Definitions
- Created by: Gina
- Created on: 22-05-15 11:09
P | M | I | N | I | M | U | M | S | P | A | N | N | I | N | G | T | R | E | E | G |
Y | W | N | S | A | Q | K | I | Q | P | X | S | A | G | V | H | S | H | U | T | O |
L | Q | H | R | U | P | Y | S | M | H | I | S | R | O | E | X | L | W | Y | L | T |
B | M | H | K | P | U | E | A | R | L | Y | E | V | E | N | T | T | I | M | E | Y |
I | A | A | T | V | R | W | A | N | R | C | X | F | A | X | Y | T | I | T | Y | U |
P | X | H | U | K | P | O | N | B | Q | I | L | C | U | P | Q | B | U | B | Q | E |
A | I | P | V | J | O | D | I | S | T | A | N | C | E | M | A | T | R | I | X | G |
R | M | A | N | U | S | D | L | X | A | N | P | G | G | E | A | K | K | J | L | Q |
T | A | R | U | H | E | L | T | D | A | L | L | T | O | T | N | W | I | F | T | A |
I | L | G | Y | N | O | G | A | L | X | S | G | Q | W | L | R | R | B | F | J | C |
T | M | D | L | C | F | F | R | Q | G | E | H | I | K | L | R | C | I | Q | H | O |
E | A | E | I | A | D | P | B | K | G | L | B | Y | P | P | G | F | E | H | L | H |
G | T | T | C | X | U | Q | P | O | R | V | R | Y | C | H | K | K | M | I | J | X |
R | C | H | S | E | M | I | E | U | L | A | R | I | A | N | G | R | A | P | H | J |
A | H | G | C | O | M | P | L | E | T | E | M | A | T | C | H | I | N | G | Y | S |
P | I | I | W | V | I | H | L | F | D | S | L | X | K | Y | T | J | J | G | Y | O |
H | N | E | Q | K | E | J | X | N | R | Q | J | C | X | O | M | O | O | B | G | C |
B | G | W | B | X | S | F | X | D | B | U | W | U | F | S | K | P | G | T | C | P |
E | J | C | C | R | I | T | I | C | A | L | A | C | T | I | V | I | T | Y | Y | Y |
F | M | U | M | E | N | T | W | M | Q | U | W | N | J | C | D | O | P | O | R | V |
H | D | E | U | L | V | N | R | Y | A | L | G | N | D | R | H | T | X | H | F | C |
Clues
- 1 to 1 pairing of all the elements in set X, with elements of set Y, in a bipartite graph (8, 8)
- 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. (7, 2, 7)
- A graph consisting of 2 sets of vertices, X and Y. the edges only join vertices in X to vertices in Y, not vertices within the same set (9, 5)
- A graph in which there is a number associated with each edge (8, 5)
- a matching in which the number of arcs is as large as possible (7, 8)
- A matrix which records the weights on the edges, No weight is indicated by '-' (8, 6)
- A spanning tree such that the total length of its arcs are as small as possible (7, 8, 4)
- An activity where any increase in it's duration results in a corresponding increase in the overall time. (8, 8)
- Precisely 2 valencies are odd, the rest are even- semi-transversable (4, 8, 5)
- The earliest time of arrival at an event allowing for the completion of all preceding events (5, 5, 4)
Similar Mathematics resources:
Teacher recommended
Comments
No comments have yet been made