D1 Crossword

Edit Answers
12345678910111213141516171819
Across
  1. 1. / The question you cannot ask Miss Lydon about D1.
  2. 2. / A graph which the edges have a direction associated with them.
  3. 3. / If a graph isn't "not connected", it's _________
  4. 4. / A graph which has 2 sets of vertices which only join to vertices from the other set.
  5. 7. / When every vertex on a graph is directly connected to every other vertex, the graph is referred to as ________.
  6. 8. / Closed path around a graph.
  7. 10. / If all valencies are even, a graph is "___________"
  8. 13. / To search an ordered list you use a ______ Search Algorithm
  9. 14. / Miss Lydon cannot pronounce it.
  10. 15. / A matrix that records the weights of the edges between the verticies.
  11. 17. / An example of a graph which many people carry in their pocket. "___________ ___"
  12. 18. / Another word for "Order"
  13. 19. / A simple graph doesn't contain any
Down
  1. 1. / Not in Kilograms
  2. 3. / First studied by Mei-Ko Kwan
  3. 5. / ______'s Agorithm
  4. 6. / Another word for verticies
  5. 9. / If there are no cycles but its connected graph?
  6. 11. / A matrix recording the number of links between the vertices.
  7. 12. Sort / Faster than Bubble
  8. 16. / Not Prims algorithm.