D1 Glossary
- Created by: chickpeatweet
- Created on: 08-06-15 19:37
C | I | S | F | T | B | R | W | K | P | K | E | X | D | F | W | K | Q | X | L | R |
L | L | T | A | O | L | M | L | A | E | N | A | W | C | E | X | K | I | K | T | W |
P | U | D | X | T | N | J | K | G | S | B | L | L | N | H | H | N | L | H | U | X |
O | E | C | N | A | E | S | J | X | E | H | O | E | P | D | U | Y | G | K | G | C |
T | X | P | H | L | H | N | U | V | E | Q | T | A | T | P | K | Q | M | R | M | Y |
P | W | G | C | F | K | L | G | C | P | W | R | D | I | G | R | A | P | H | F | I |
U | Y | Y | W | L | B | V | G | S | O | G | X | B | G | E | O | N | K | H | B | L |
K | C | P | H | O | A | K | Y | R | E | P | G | H | O | E | N | P | I | E | W | T |
S | P | P | A | A | Y | E | K | T | N | N | M | B | M | R | R | G | F | V | J | B |
B | U | I | Y | T | G | T | I | H | I | O | A | K | V | G | T | A | R | Y | I | E |
D | S | R | S | W | O | T | B | E | U | R | T | H | S | E | B | X | U | P | J | X |
Y | D | A | N | O | R | P | N | U | N | E | C | H | A | D | Y | J | J | P | Q | T |
Q | M | Y | V | A | H | J | S | H | R | I | H | U | K | P | A | G | G | O | J | T |
V | G | C | P | T | T | M | V | L | I | X | I | I | R | Q | N | C | M | U | F | O |
B | S | I | H | H | V | Q | S | P | A | N | N | I | N | G | T | R | E | E | C | R |
C | B | W | U | D | G | B | B | H | N | B | G | I | L | R | W | C | I | P | P | E |
J | D | T | J | X | M | K | T | R | K | T | A | V | H | K | H | B | G | F | F | M |
H | C | O | N | N | E | C | T | E | D | G | R | A | P | H | N | P | N | F | S | Q |
M | I | N | I | M | U | M | S | P | A | N | N | I | N | G | T | R | E | E | L | V |
U | G | B | H | G | L | D | U | E | U | W | E | F | N | G | E | D | S | W | F | E |
C | D | V | P | E | Y | D | I | R | E | M | B | F | G | S | P | E | W | G | I | P |
Clues
- A closed path in which the end vertex of the last edge is the starting vertex of the first edge (5)
- A graph which has a weight on each arc (7)
- A spanning tree in which the total weight of its arcs is as small as possible (7, 8, 4)
- A subgraph which includes all the vertices of the original graph and is a tree (8, 4)
- A type of graph consisting of two sets of vertices, X + Y, and the edges only join vertices in X to Y, not within sets (9, 5)
- A type of graph which has directed edges (7)
- All vertices are connected by a path (9, 5)
- Latest event time - earliest event time - duration (5, 5)
- The number of edges incident to a vertex (6)
- The pairing of some or all of the vertices from set X to the vertices in set Y (8)
Comments
No comments have yet been made