MCPcopy Create free account

hub / github.com/AhmadElsagheer/Competitive-programming-library / functions

Functions309 in github.com/AhmadElsagheer/Competitive-programming-library

⨍ Functions 309◇ Types & classes 87
↓ 50 callersMethodadd
(T v)
data_structures/SkipList.java:42
↓ 31 callersMethodnextInt
()
other_algorithms/Scanner.java:23
↓ 14 callersMethodget
(int index)
data_structures/IndexableSkipList.java:180
↓ 14 callersMethodsqrt
(double n)
math/NewtonMethod.java:17
↓ 13 callersMethodremove
(int index)
data_structures/IndexableSkipList.java:47
↓ 12 callersMethodaddEdge
(int u, int v)
graphs/special/EulerTour.java:40
↓ 12 callersMethodcompareTo
(Query q)
data_structures/MoAlgorithm.java:50
↓ 11 callersMethodbetween
(Point p, Point q)
geometry/Point.java:44
↓ 11 callersMethoddist
(Point p)
geometry/Point.java:18
↓ 8 callersMethodcompareTo
(Point p)
geometry/Point.java:11
↓ 7 callersMethodsize
()
data_structures/TreapSet.java:153
↓ 7 callersMethodsort
(int[] SA, int[] RA, int n, int k)
strings/SuffixArray.java:34
↓ 7 callersMethodupdate
(Node<K> root)
data_structures/TreapSet.java:155
↓ 6 callersMethodccw
(Point p, Point q, Point r)
geometry/Point.java:72
↓ 5 callersMethodcross
(Vector v)
geometry/Vector.java:15
↓ 5 callersMethodfindSet
(int i)
data_structures/UnionFind.java:16
↓ 5 callersMethodgetBlock
(int x)
graphs/traversal/BridgesOnline.java:48
↓ 5 callersMethodnorm2
()
geometry/Vector.java:17
↓ 5 callersMethodtranslate
(Vector v)
geometry/Point.java:35
↓ 4 callersMethodcontains
(Point p)
geometry/Rectangle.java:13
↓ 4 callersMethodnext
()
other_algorithms/Scanner.java:16
↓ 3 callersMethoddot
(Vector v)
geometry/Vector.java:13
↓ 3 callersMethodintersect
(Line l)
geometry/Line.java:27
↓ 3 callersMethodmapState
(int p, int t, int turn)
math/game_theory/PoliceAndThief.java:81
↓ 3 callersMethodparallel
(Line l)
geometry/Line.java:23
↓ 3 callersMethodquery
(int u, int v)
data_structures/HLD.java:59
↓ 2 callersMethodadd
(int val)
data_structures/MoAlgorithm.java:11
↓ 2 callersMethodarea
()
geometry/Triangle.java:24
↓ 2 callersMethoddegToRad
(double d)
geometry/Geometry.java:7
↓ 2 callersMethoddfs
(int u)
graphs/traversal/GraphTraversal.java:25
↓ 2 callersMethoddfs
(int u, boolean fillingStack)
graphs/traversal/KosarajuAlgorithm.java:43
↓ 2 callersMethoddist
(Point p)
geometry/LineSweep.java:48
↓ 2 callersMethodevaluate
(double x)
math/Polynomial.java:11
↓ 2 callersMethodextract
(int u)
graphs/traversal/BridgeTree.java:54
↓ 2 callersMethodfindSet
(int x)
graphs/mst/MST_Kruskal.java:42
↓ 2 callersMethodgetComp
(int x)
graphs/traversal/BridgesOnline.java:50
↓ 2 callersMethodmatMul
(int[][] A, int[][] B, int p, int q, int r)
math/Exponentiation.java:41
↓ 2 callersMethodnextDouble
()
other_algorithms/Scanner.java:29
↓ 2 callersMethodnormalize
()
geometry/Vector.java:21
↓ 2 callersMethodonRay
(Point a, Point b)
geometry/Point.java:64
↓ 2 callersMethodperm
()
geometry/Triangle.java:19
↓ 2 callersMethodpow
(int a, int e)
math/Exponentiation.java:8
↓ 2 callersMethodpow
(long a, int n)
math/number_theory/PrimeFactorization.java:67
↓ 2 callersMethodpropagate
(int node, int b, int mid, int e)
data_structures/trees/SegmentTree.java:70
↓ 2 callersMethodput
(char[] s, int idx)
strings/SuffixTrie.java:11
↓ 2 callersMethodquery_up
(int v, int u)
data_structures/HLD.java:65
↓ 2 callersMethodrandomizeLevel
()
data_structures/IndexableSkipList.java:39
↓ 2 callersMethodremove
(int val)
data_structures/MoAlgorithm.java:17
↓ 2 callersMethodrotateLeft
(Node<K> root)
data_structures/TreapSet.java:121
↓ 2 callersMethodrotateRight
(Node<K> root)
data_structures/TreapSet.java:131
↓ 2 callersMethodscale
(double s)
geometry/Vector.java:11
↓ 2 callersMethodsq
(double x)
geometry/Point.java:20
↓ 2 callersMethodswap
(char[] c,int i, int j)
math/Permutations.java:44
↓ 2 callersMethodvalid
(int x, int y)
math/game_theory/PoliceAndThief.java:79
↓ 1 callersMethodaddLetter
(char c)
strings/SuffixAutomaton.java:22
↓ 1 callersMethodangle
(Point a, Point o, Point b)
geometry/Point.java:82
↓ 1 callersMethodarea
()
geometry/Circle.java:21
↓ 1 callersMethodarea
()
geometry/Polygon.java:22
↓ 1 callersMethodaug
(int u)
graphs/special/MCBM.java:32
↓ 1 callersMethodaugment
(int v, int flow)
graphs/max_flow/MaxFlow1.java:49
↓ 1 callersMethodbalance
(Node<K> root)
data_structures/TreapSet.java:27
↓ 1 callersMethodbfs
()
graphs/max_flow/MaxFlow2.java:29
↓ 1 callersMethodbfs
()
graphs/special/MCBM.java:61
↓ 1 callersMethodbiConnectedComponents
()
graphs/traversal/BiconnectedComponents.java:18
↓ 1 callersMethodbuild
(int node, int b, int e)
data_structures/HLD.java:207
↓ 1 callersMethodbuild
(int node, int b, int e)
data_structures/trees/SegmentTree.java:20
↓ 1 callersMethodbuild
(int node, int i, int j, int len)
data_structures/trees/QuadTree.java:63
↓ 1 callersMethodbuildX
(int vx, int lx, int rx)
data_structures/trees/SegmentTree2D.java:17
↓ 1 callersMethodbuildY
(int vx, int lx, int rx, int vy, int ly, int ry)
data_structures/trees/SegmentTree2D.java:28
↓ 1 callersMethodcircum
()
geometry/Circle.java:19
↓ 1 callersMethodclosestPoint
(Point p)
geometry/Line.java:41
↓ 1 callersMethodderivative
()
math/Polynomial.java:19
↓ 1 callersMethoddfs
(int u, int flow)
graphs/max_flow/MaxFlow2.java:51
↓ 1 callersMethoddfs
(int u, int p)
graphs/traversal/BiconnectedComponents.java:25
↓ 1 callersMethoddfs
(int u, int p)
graphs/traversal/BridgeTree.java:35
↓ 1 callersMethoddfs
(int u)
graphs/traversal/ArticulationPointsAndBridges.java:28
↓ 1 callersMethoddfs
(int u, int depth)
graphs/trees/EulerWalk.java:11
↓ 1 callersMethoddfs
(int u)
graphs/special/MCBM.java:87
↓ 1 callersMethoddfs
(int u, int parent, int depth)
data_structures/HLD.java:122
↓ 1 callersMethoddfs1
(int u)
graphs/trees/TreeDiameter.java:17
↓ 1 callersMethoddfs2
(int u, int h)
graphs/trees/TreeDiameter.java:34
↓ 1 callersMethoddistToLine
(Point p, Point a, Point b)
geometry/Point.java:88
↓ 1 callersMethodeulerTour
(ListIterator<Integer> itr, int u)
graphs/special/EulerTour.java:22
↓ 1 callersMethodfindNode
(int node, int i, int j, int len, int a, int b)
data_structures/trees/QuadTree.java:86
↓ 1 callersMethodgetFirst
(char[] c)
math/Permutations.java:35
↓ 1 callersMethodgetIndex
(E val)
data_structures/IndexableSkipList.java:162
↓ 1 callersMethodgetRandomLevel
()
data_structures/SkipList.java:34
↓ 1 callersMethodgo
(int vIdx, int c)
strings/AhoCorasick.java:56
↓ 1 callersMethodgo
()
graphs/traversal/BiconnectedComponents.java:56
↓ 1 callersMethodgo
(int root)
data_structures/HLD.java:81
↓ 1 callersMethodhld
(int cur)
data_structures/HLD.java:137
↓ 1 callersMethodisSameSet
(int i, int j)
data_structures/UnionFind.java:18
↓ 1 callersMethodlca_query
(int p, int q)
data_structures/HLD.java:162
↓ 1 callersMethodlink
(int vIdx)
strings/AhoCorasick.java:48
↓ 1 callersMethodmakeRoot
(int u)
graphs/traversal/BridgesOnline.java:78
↓ 1 callersMethodmerge
(int[] a, int b, int mid, int e)
data_structures/sortings/MergeSort.java:24
↓ 1 callersMethodmergePath
(int u, int v)
graphs/traversal/BridgesOnline.java:92
↓ 1 callersMethodprefixFunction
(char[] s)
strings/PrefixAutomaton.java:6
↓ 1 callersMethodprint
()
data_structures/SkipList.java:91
↓ 1 callersMethodquery
(int a1, int b1, int a2, int b2)
data_structures/trees/QuadTree.java:119
next →1–100 of 309, ranked by callers