Skip to content
ICPC.NINJA
Home
Type to start searching
jchrys/icpc
ICPC.NINJA
jchrys/icpc
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
Preface
DFSTree
StartingFinishingTime
FindingCutEdges
Tree
Tree
Basics
Traversal
DP
SpanningTree
TreeQueries
Sort
Sort
InsertionSort
BubbleSort
HeapSort
QuickSort
Euclidean
Linear
Linear
BinarySearch
Lower and Upper Bounds
String
String
Preface
String Hashing
Z-Algorithm
KMP-Algorithm
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
SearchTree
BST
RedBlackTree
Binary Indexed Tree
Segment Tree
Trie
NumberTheory
NumberTheory
Divisibility
MobiusInversion
MISC
MISC
Lemma
Language
Language
Preface
Keywords
Class
Contribute
Contribute
HowToContribute
CodeOfConduct
Template
Emoji
Welcome to ICPC.NINJA
¶
Implementations of Algorithms for competitive programming