D1 Glossary
- Created by: Monikak
- Created on: 25-05-16 12:36
O | X | W | D | X | I | M | Q | J | T | B | A | R | F | Q | N | W | C | W | E | Y |
X | O | E | E | W | K | I | V | R | T | F | A | X | O | X | M | K | X | Q | Y | F |
Q | X | I | T | A | Y | N | E | B | F | Y | G | W | I | E | Y | Q | H | K | J | J |
Q | F | G | C | K | M | I | L | D | A | P | T | L | A | T | H | U | P | F | K | H |
V | B | H | E | C | Y | M | C | N | B | B | I | C | H | R | D | W | A | O | Y | F |
P | A | T | N | A | Q | U | S | S | J | M | V | O | P | E | G | V | R | D | C | A |
W | G | E | N | D | Y | M | P | Q | F | C | T | M | A | V | E | J | G | K | T | J |
O | U | D | O | M | O | S | A | T | M | B | Q | P | R | A | A | A | E | G | Y | I |
Y | S | G | C | D | B | P | N | A | M | K | N | L | G | F | V | X | T | G | U | L |
M | Q | R | X | U | O | A | N | A | A | O | P | E | A | O | U | N | I | F | C | O |
H | G | A | G | D | C | N | I | U | T | A | A | T | I | E | K | G | T | O | D | N |
V | S | P | C | F | B | N | N | O | C | A | X | E | D | E | M | B | R | H | T | U |
T | O | H | K | K | V | I | G | K | H | U | X | M | V | R | Q | I | A | P | Q | J |
L | P | N | Q | L | K | N | T | D | I | S | P | A | C | G | I | V | P | A | E | K |
H | E | E | L | A | Y | G | R | X | N | U | S | T | W | E | Q | G | I | R | L | A |
B | M | T | D | M | D | T | E | I | G | S | N | C | Y | D | R | F | B | G | E | U |
N | P | W | Y | Q | S | R | E | U | A | R | F | H | P | I | Y | H | U | B | L | J |
D | O | O | G | Q | N | E | S | K | M | O | O | I | S | Q | N | P | P | U | O | B |
Y | A | R | L | G | R | E | F | T | A | J | V | N | Q | P | M | K | L | S | V | F |
A | F | K | S | K | U | U | P | B | D | X | H | G | C | S | L | P | V | W | H | T |
G | X | L | R | I | D | T | T | O | T | X | F | Y | H | H | C | A | G | T | H | A |
Clues
- A graph whose edges have a direction associated with them (8)
- A graph, each of whose vertices and edges belongs to G. (8, 2, 1)
- Consists of two sets of vertices X and Y. The edges only join vertices in X to vertices in Y (9, 5)
- If a graph has a weight associated with each of its edges. (8, 12)
- If every member of one set, X, is paired with every member of set Y (8, 8)
- Number of edges incident to the vertex. (6, 2, 1, 6)
- Pairing of some or all the elements of one set with the elements of a second set (8)
- Spanning tree such that the total length of its arcs is as small as possible (7, 8, 4)
- Subgraph which includes all the vertices of G and is also a tree (8, 4)
- Two vertices are connected if there's a path between them. (9)
Comments
No comments have yet been made