Skip to content

C1 Research Computing and Software Development

13 · Graphs and greedy algorithms

Initializing search

C1 Research Computing and Software Development

Home
Lectures
Lectures
- Overview
- Foundations
  Foundations
- Complexity
  Complexity
  - 6 · Algorithms: easy versus hard
  - 7 · Divide and conquer
  - 8 · Dynamic programming
  - 13 · Graphs and greedy algorithms 13 · Graphs and greedy algorithms
    Table of contents
    
    Content
  - 14 · Complexity V
  - 16 · Complexity VI
- Python
  Python
- Packages and quality
  Packages and quality
  - 12 · From scripts to an installable package
  - 15 · Testing, documentation and continuous integration
- Scientific computing
  Scientific computing
- Software services
  Software services
  - 20 · Research software as a web service
  - 21 · Distribution and deployment: wheels and containers
- Accelerated computing
  Accelerated computing
  - 23 · Differentiable and compiled Python with JAX
  - 24 · Cloud computing and accelerators
Example Classes
CSD3 access
Assessment
Assessment
- Past papers

Lecture 13 — Graphs and greedy algorithms

Thu 5 Nov 2026 · Alessandro Favero

Content

Shortest paths: breadth-first search
Shortest paths: Dijkstra
Priority queues and heaps
Minimum spanning trees: Prim
Minimum spanning trees: Kruskal
Clustering