• 1 Graph Theory ▶
    • 1.1 Basic
    • 1.2 Structures ▶
      • 1.2.1 Trees
    • 1.3 Connectivity ▶
      • 1.3.1 Reachability and distance
    • 1.4 Coloring
    • 1.5 Matching
    • 1.6 Minors
    • 1.7 Spectral
    • 1.8 Embeddings
  • 2 Graph Algorithms ▶
    • 2.1 Traversal ▶
      • 2.1.1 Breadth-first search
    • 2.2 Search
    • 2.3 Shortest Path
    • 2.4 MST
    • 2.5 Flow
    • 2.6 SCC
  • 3 Data Structures ▶
    • 3.1 Binary Tree
    • 3.2 Splay Tree
    • 3.3 Union Find ▶
      • 3.3.1 Inverse Ackermann
  • 4 Bibliography
  • Dependency graph

AlgoLib

The AlgoLib Team

  • 1 Graph Theory
    • 1.1 Basic
    • 1.2 Structures
      • 1.2.1 Trees
    • 1.3 Connectivity
      • 1.3.1 Reachability and distance
    • 1.4 Coloring
    • 1.5 Matching
    • 1.6 Minors
    • 1.7 Spectral
    • 1.8 Embeddings
  • 2 Graph Algorithms
    • 2.1 Traversal
      • 2.1.1 Breadth-first search
    • 2.2 Search
    • 2.3 Shortest Path
    • 2.4 MST
    • 2.5 Flow
    • 2.6 SCC
  • 3 Data Structures
    • 3.1 Binary Tree
    • 3.2 Splay Tree
    • 3.3 Union Find
      • 3.3.1 Inverse Ackermann
  • 4 Bibliography