Skip to content

ICPC.NINJA Home

Type to start searching

ICPC.NINJA

Home
Algorithms
Algorithms
- Graph
  Graph
  - Basics
  - Graph Traversal
  - Directed Graphs
  - Strong Connectivity
  - Shortest Paths
    Shortest Paths
    
    Preface
    
    Bellman-Ford
    
    Dijkstra
    
    Floyd-Warshall
  - Eulerian Paths
  - Hamiltonian Paths
  - De Bruijn sequences
  - Knight's tours
  - Maximum flow
  - Minimum cut
  - Ford-Fulkerson
  - Disjoint Paths
  - Maximum Matchings
  - Konig's Theorem
  - Path Covers
- DFS
  DFS
- Tree
  Tree
  - Basics
  - Traversal
  - DP
  - SpanningTree
  - TreeQueries
- Sort
  Sort
- Euclidean
- Linear
  Linear
  - BinarySearch
  - Lower and Upper Bounds
- String
  String
- Range Queries
  Range Queries
  - Preface
  - StaticArrayQueries
- Bit
  Bit
  - FastPower
  - BitManipulation
DataStructures
DataStructures
- Linear
  Linear
  - Stack
  - Vector
  - Heap
  - Linked List
  - Pair
- Hash Tables
  Hash Tables
  - Preface
  - Hash Functions
- Trees
  Trees
NumberTheory
NumberTheory
- Divisibility
- MobiusInversion
MISC
MISC
- Lemma
Language
Language
- Preface
- Keywords
- Class
Contribute
Contribute



Welcome to ICPC.NINJA¶

Implementations of Algorithms for competitive programming

jchrys ©2019~

powered by MkDocs and Material for MkDocs