Decision Maths Definitions

12345678910111213141516171819202122232425262728293031323334353637383940
Across
  1. 4. a graph that can be traversed once using all edges which starts and finishes at the same vertex
  2. 5. a matrix which shows the number of arcs joining the corresponding vertices
  3. 9. what you get when you divide the sum of all the activities by the length of the critical path
  4. 16. the latest time of departure without extending the length of the project
  5. 18. graphs which show the same information but may be drawn differently
  6. 20. what you can find to improve the upper bound from a minimum spanning tree
  7. 21. the amount of time that a start may be delayed without affecting the duration of the project
  8. 24. a table that shows which activities must be completed before others start
  9. 25. the number of times you visit each vertex in the classical travelling salesman problem
  10. 27. the number of times you visit each vertex in the practical travelling salesman problem
  11. 28. a graph that has no loops and no more than one edge connecting any two vertices
  12. 29. a finite sequence of arcs where the end vertex of one is the start of the next and in which no vertex appears more then once
  13. 30. a route through a graph that visits every vertex
  14. 31. two vertices are _________ if there is a path between them
  15. 32. the name of the first vertex in a network
  16. 34. a graph that has directed edges
  17. 35. this cycle includes every vertex
  18. 36. a finite sequence of step by step instructions
  19. 37. a connected graph with no cycles
  20. 38. the region of a graph that satisfies all the constraints
  21. 40. an activity that has no time or cost
Down
  1. 1. a subgraph which includes all the vertices of a graph and is also a tree
  2. 2. the name of the function which must be maximised or minimised
  3. 3. this sort uses pivots
  4. 6. what you must do to the minimum spanning tree to find an initial upper bound
  5. 7. a graph in which every vertex is connected to every other vertex
  6. 8. the total number of arcs connected to a vertex
  7. 10. this algorithm finds an upper bound and must go back to the start
  8. 11. a matrix where the numbers represent the weight of each arc
  9. 12. a graph that can be traversed once using all edges which starts and finishes at different vertices
  10. 13. an activity where any increase in its duration leads to an increase in the duration of the whole project
  11. 14. the earliest time of arrival allowing for the completion of all previous activities
  12. 15. there can be at most one activity between two events, so each activity must be ______________
  13. 17. a matrix that shows the shortest path between any two points on the network
  14. 19. the name of the final vertex in a network
  15. 22. a path where the end vertex of the last edge is the start vertex of the first edge
  16. 23. the theory that there must be an even number of odd vertices
  17. 26. a route through a graph along edges from one vertex to the next
  18. 33. this locates items in a list
  19. 39. an edge that starts and finishes at the same vertex