MCPcopy Create free account

hub / github.com/PetarV-/Algorithms / functions

Functions325 in github.com/PetarV-/Algorithms

⨍ Functions 325◇ Types & classes 54
↓ 62 callersMethodpush
Data Structures/Bit Queue.cpp:55
↓ 34 callersMethodpop
Data Structures/Bit Queue.cpp:64
↓ 34 callersMethodsize
Data Structures/Bit Queue.cpp:50
↓ 14 callersFunctionsplay
Data Structures/Link-cut Tree.cpp:117
↓ 13 callersMethodinOrderPrint
Data Structures/Splay Tree.cpp:366
↓ 13 callersMethodinOrderPrint
Data Structures/Binary Search Tree.cpp:272
↓ 13 callersMethodinsert
Data Structures/Splay Tree.cpp:263
↓ 13 callersMethodprettyPrint
Data Structures/Binary Search Tree.cpp:286
↓ 10 callersMethodInsert
Data Structures/Binary Search Tree.cpp:149
↓ 10 callersFunctionnussinov
Dynamic Programming/Nussinov Algorithm.cpp:49
↓ 9 callersMethodmin
Data Structures/van Emde Boas Tree.cpp:222
↓ 9 callersMethodprint
Data Structures/Circular Doubly-Linked List.cpp:191
↓ 8 callersMethodinsert
Data Structures/Proto-vEB Tree.cpp:90
↓ 8 callersMethodinsert
Data Structures/Circular Doubly-Linked List.cpp:86
↓ 8 callersMethodinsert
Data Structures/van Emde Boas Tree.cpp:99
↓ 7 callersFunctionfind
Data Structures/Trie.cpp:60
↓ 7 callersFunctiongetnext
Miscellaneous/Fast Input (Thanks to Ermin Hodzic).cpp:28
↓ 7 callersMethodmax
Data Structures/van Emde Boas Tree.cpp:227
↓ 6 callersFunctionexpose
Data Structures/Link-cut Tree.cpp:141
↓ 5 callersFunctionBinomialCoefficient
Mathematical Algorithms/Pascal's Triangle.cpp:32
↓ 5 callersFunctionPush
Data Structures/Priority Queue.cpp:40
↓ 5 callersFunctionaddEdge
Graph Algorithms/Dinic's Algorithm.cpp:114
↓ 5 callersMethodinsert
Data Structures/Binomial Heap.cpp:88
↓ 5 callersMethodinsert
Data Structures/Pairing Heap.cpp:83
↓ 5 callersMethodinsert
Data Structures/Fibonacci Heap.cpp:94
↓ 5 callersFunctionisLeft
Geometric Algorithms/Point in Convex Polygon.cpp:51
↓ 5 callersMethodmerge
Data Structures/Pairing Heap.cpp:88
↓ 5 callersMethodmin
Data Structures/Proto-vEB Tree.cpp:164
↓ 5 callersFunctionrotate
Data Structures/Link-cut Tree.cpp:73
↓ 5 callersFunctionupdate
Data Structures/Binary Indexed Tree.cpp:29
↓ 4 callersMethodDelete
Data Structures/van Emde Boas Tree.cpp:158
↓ 4 callersFunctionFind
Graph Algorithms/Kruskal's Algorithm.cpp:53
↓ 4 callersFunctionMakeSet
Data Structures/Disjoint Set Union.cpp:35
↓ 4 callersFunctionUnion
Data Structures/Disjoint Set Union.cpp:48
↓ 4 callersFunctionisBetween
Geometric Algorithms/Segment Intersection.cpp:55
↓ 4 callersFunctionisCollinear
Geometric Algorithms/Segment Intersection.cpp:45
↓ 4 callersMethodisEmpty
Data Structures/Fibonacci Heap.cpp:89
↓ 4 callersMethodsearch
Data Structures/Binary Search Tree.cpp:103
↓ 4 callersFunctiontraverseForward
Data Structures/XOR Linked List.c:134
↓ 3 callersFunctionEmpty
Data Structures/Priority Queue.cpp:29
↓ 3 callersFunctionencode
Huffman-encode a given character
Compression Algorithms/Huffman Coding.cpp:135
↓ 3 callersFunctioninPolygon
Geometric Algorithms/Point in Convex Polygon.cpp:74
↓ 3 callersFunctioninsert
Data Structures/Trie.cpp:46
↓ 3 callersMethodisEmpty
Data Structures/Pairing Heap.cpp:78
↓ 3 callersMethodmax
Data Structures/Proto-vEB Tree.cpp:181
↓ 3 callersFunctionpivot
pivot yth variable around xth constraint
Mathematical Algorithms/Simplex Algorithm.cpp:58
↓ 3 callersFunctionsend
Data Structures/Bit Queue.cpp:75
↓ 2 callersFunctionBitonicSorter
Sorts a bitonic sequence A[lo..hi]
Sorting Algorithms/Bitonic Sorter.cpp:43
↓ 2 callersMethodDelete
Data Structures/Splay Tree.cpp:319
↓ 2 callersMethodDelete
Data Structures/Proto-vEB Tree.cpp:126
↓ 2 callersMethodDelete
Data Structures/Binary Search Tree.cpp:196
↓ 2 callersFunctionFind
Data Structures/Disjoint Set Union.cpp:41
↓ 2 callersFunctionLCA
Graph Algorithms/Heavy-Light Decomposition.cpp:75
↓ 2 callersFunctionMatrixMultiply
Mathematical Algorithms/Matrix Exponentiation.cpp:27
↓ 2 callersFunctionQuery
Data Structures/Segment Tree.cpp:57
↓ 2 callersFunctionUpdate
Data Structures/Segment Tree.cpp:45
↓ 2 callersFunctionaddAfter
Data Structures/XOR Linked List.c:27
↓ 2 callersFunctioncompare
Comparator between values a and b
Sorting Algorithms/Bitonic Sorter.cpp:37
↓ 2 callersFunctioncomplementary
Dynamic Programming/Nussinov Algorithm.cpp:44
↓ 2 callersFunctioncrossProduct
Geometric Algorithms/Segment Intersection.cpp:35
↓ 2 callersFunctiondecode
Huffman-decode the given string
Compression Algorithms/Huffman Coding.cpp:166
↓ 2 callersMethoddecreaseKey
Data Structures/Fibonacci Heap.cpp:238
↓ 2 callersMethodextractMin
Data Structures/Pairing Heap.cpp:125
↓ 2 callersMethodextractMin
Data Structures/Fibonacci Heap.cpp:124
↓ 2 callersFunctionf
Searching Algorithms/Ternary Search.cpp:25
↓ 2 callersMethodisEmpty
Data Structures/Circular Doubly-Linked List.cpp:81
↓ 2 callersFunctionisLeft
Geometric Algorithms/Segment Intersection.cpp:40
↓ 2 callersFunctioniterate_simplex
Run a single iteration of the simplex algorithm. Returns: 0 if OK, 1 if STOP, -1 if UNBOUNDED
Mathematical Algorithms/Simplex Algorithm.cpp:107
↓ 2 callersMethodmaximum
Data Structures/Binary Search Tree.cpp:118
↓ 2 callersMethodmerge
Data Structures/Binomial Heap.cpp:144
↓ 2 callersFunctionmod_pow
Mathematical Algorithms/Exponentiation by Squaring.cpp:25
↓ 2 callersFunctionmodinv
Mathematical Algorithms/Extended Euclidean Algorithm.cpp:55
↓ 2 callersFunctionoppositeSides
Geometric Algorithms/Segment Intersection.cpp:50
↓ 2 callersMethodpred
Data Structures/van Emde Boas Tree.cpp:232
↓ 2 callersFunctionsubtree_max
Data Structures/Splay Tree.cpp:305
↓ 2 callersMethodsucc
Data Structures/van Emde Boas Tree.cpp:280
↓ 2 callersFunctiontraverseBackward
Data Structures/XOR Linked List.c:153
↓ 1 callersFunctionBFS
Graph Algorithms/Breadth-First Search.cpp:33
↓ 1 callersFunctionBFS
Graph Algorithms/Edmonds-Karp Algorithm.cpp:40
↓ 1 callersFunctionBFS
Graph Algorithms/Dinic's Algorithm.cpp:47
↓ 1 callersFunctionBellmanFord
Graph Algorithms/Bellman-Ford Algorithm.cpp:37
↓ 1 callersFunctionCCW
Geometric Algorithms/Graham Scan.cpp:50
↓ 1 callersFunctionDFS
Graph Algorithms/Cycle Detection.cpp:35
↓ 1 callersFunctionDFS
Graph Algorithms/Heavy-Light Decomposition.cpp:48
↓ 1 callersFunctionDFS
Graph Algorithms/Connected Components.cpp:35
↓ 1 callersFunctionDFS
Graph Algorithms/Ford-Fulkerson Algorithm.cpp:40
↓ 1 callersFunctionDFS
Graph Algorithms/Depth-First Search.cpp:33
↓ 1 callersFunctionDFS
Graph Algorithms/Dinic's Algorithm.cpp:71
↓ 1 callersMethodDelete
Data Structures/Circular Doubly-Linked List.cpp:147
↓ 1 callersMethodDelete
Data Structures/Pairing Heap.cpp:195
↓ 1 callersMethodDelete
Data Structures/Fibonacci Heap.cpp:302
↓ 1 callersFunctionDijkstra
Graph Algorithms/Dijkstra's Algorithm.cpp:48
↓ 1 callersFunctionDinic
Graph Algorithms/Dinic's Algorithm.cpp:97
↓ 1 callersFunctionEdmondsKarp
Graph Algorithms/Edmonds-Karp Algorithm.cpp:84
↓ 1 callersFunctionFirstFit
Fit an item of size val
Greedy Algorithms/First-Fit Bin Packing.cpp:81
↓ 1 callersFunctionFloydWarshall
Graph Algorithms/Floyd-Warshall Algorithm.cpp:32
↓ 1 callersFunctionFordFulkerson
Graph Algorithms/Ford-Fulkerson Algorithm.cpp:84
↓ 1 callersFunctionGetMinimum
Data Structures/Priority Queue.cpp:34
↓ 1 callersFunctionGrahamScan
Geometric Algorithms/Graham Scan.cpp:55
↓ 1 callersFunctionHLD
Graph Algorithms/Heavy-Light Decomposition.cpp:62
next →1–100 of 325, ranked by callers