D1 Crossword

2. / A simple graph doesn't contain any
3. / To search an ordered list you use a ______ Search Algorithm
5. / A graph which the edges have a direction associated with them.
6. / Miss Lydon cannot pronounce it.
7. / An example of a graph which many people carry in their pocket. "___________ ___"
9. / A matrix that records the weights of the edges between the verticies.
11. / Another word for "Order"
13. / Another word for verticies
14. / If all valencies are even, a graph is "___________"
17. / The question you cannot ask Miss Lydon about D1.
18. Sort / Faster than Bubble
19. / If there are no cycles but its connected graph?
20. / When every vertex on a graph is directly connected to every other vertex, the graph is referred to as ________.

1. / If a graph isn't "not connected", it's _________
4. / First studied by Mei-Ko Kwan "_______ _______"
8. / A matrix recording the number of links between the vertices.
10. / Not in Kilograms
12. / Not Prims algorithm.
15. / ______'s Agorithm
16. / A graph which has 2 sets of vertices which only join to vertices from the other set.
20. / Closed path around a graph.