Algorithmics 25

This vault contains notes for VCE Algorithmics HESS, for the accreditation period 2023-2026. Work in progress.

Notes are grouped by units and follows the algorithmics study design. Code snippets will be written in Python 3, with usage of the NetworkX and matplotlib libraries. The notes are open source on GitHub.

Primary references:

• Gouros, G. (2022). Algorithmics (HESS) Student Guide.
• Meyer, B. and Bird, S. (2018). VCE Algorithmics (2017 Edition).
• Taylor. (2017). Algorithmics 21.

Table of Contents

Unit 3

• Graph theory
  • Graph
  • Graph theory notation
  • Graph travelling
    • Circuit, cycle, Eulerian trail, Eulerian circuit, Hamiltonian path, Hamiltonian cycle
  • Graph properties
    • Acyclic, cyclic
  • Types of graphs
    • Complete, connected, directed acyclic, directed, labelled, planar, simple, subgraph, undirected, weighted, tree, isomorphic
  • Diameter of a graph, distance
• Abstract data types
  • Abstract data type
    • Set, list, array, dictionary, stack, queue, priority queue, graph
  • Abstract data type signature
• Boolean algebra
  • AND, OR, NOT
• Algorithm design
  • Algorithm
  • Algorithm types
  • Implementations
    • Graph traversal
      • Best-first search
      • Breadth-first search
      • Depth-first search
    • Shortest path
      • Bellman-Ford algorithm
      • Dijkstra’s algorithm
      • Floyd-Warshall algorithm
    • Prim’s Algorithm