Skip to content

Latest commit

 

History

History
25 lines (21 loc) · 610 Bytes

File metadata and controls

25 lines (21 loc) · 610 Bytes

D1

D1 is the first module in the "Decision Mathematics" strand of the A-level GCE qualification. It covers the following topics

  1. Fundamental algorithms **Sorting **Binary search **Bin packing
  2. Graphs ** Kruskal's algorithm ** Prims's algorithm ** Dijkstra's algorithm ** Transversable graphs ** The Chinese postman problem
  3. Critical Path analysis ** Activity networks. ** Gannt Charts
  4. Linear Programming ** 2 varible problems
  5. Matching problems **Bipartite graphs **The maximal matching algorithm

These file represent an attempt to implement these algorithms in python.