# Bitmap

• Hoshen–Kopelman algorithm / 2 - The algorithm makes two passes over the image: the first pass to assign temporary labels and record equivalences, and the second pass to replace each temporary label by the smallest label of its equivalence class.
  • the HK-algorithm is really just a special application of the Union-Find algorithm
• Image processing learning ressource

# Graph

• Strongly Connected Components / Connected Components
  • Kosaraju’s algorithm.
  • Tarjan’s Algorithm