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
↓ 1 callersMethodreverse
()
geometry/Vector.java:19
↓ 1 callersMethodsame
(Line l)
geometry/Line.java:25
↓ 1 callersMethodsearch
(T key)
data_structures/SkipList.java:74
↓ 1 callersMethodsectorArea
(double deg)
geometry/Circle.java:30
↓ 1 callersMethodsumX
(int vx, int lx, int rx, int bx, int ex, int by, int ey)
data_structures/trees/SegmentTree2D.java:50
↓ 1 callersMethodsumY
(int vx, int vy, int ly, int ry, int by, int ey)
data_structures/trees/SegmentTree2D.java:62
↓ 1 callersMethodswap
(int u)
graphs/trees/TreeDiameter.java:53
↓ 1 callersMethodunion
(int x, int y)
graphs/mst/MST_Kruskal.java:44
↓ 1 callersMethodupdate
(int node, int val)
data_structures/HLD.java:53
↓ 1 callersMethodupdatePoint
(int a, int b, int val)
data_structures/trees/QuadTree.java:101
↓ 1 callersMethodupdateX
(int vx, int lx, int rx, int i, int j, int val)
data_structures/trees/SegmentTree2D.java:76
↓ 1 callersMethodupdateY
(int vx, int lx, int rx, int vy, int ly, int ry, int j, int val)
data_structures/trees/SegmentTree2D.java:89
↓ 1 callersMethodupdate_point
(int index, int val)
data_structures/HLD.java:220
↓ 1 callersMethodvalid
(int i, int j)
graphs/traversal/GraphTraversal.java:116
MethodAhoCorasick
(int maxNodes)
strings/AhoCorasick.java:26
MethodBridgesOnline
(int V)
graphs/traversal/BridgesOnline.java:34
MethodCircle
(Point p, double k)
geometry/Circle.java:10
MethodEdge
(int a, int b)
graphs/mst/MST_Prim.java:35
MethodEdge
(int a, int b, int c)
graphs/mst/MST_Kruskal.java:26
MethodEdge
(int a, int b)
graphs/shortest_path/SSSP.java:73
MethodEdge
(int x)
graphs/special/EulerTour.java:16
MethodFenwickTree
(int size)
data_structures/trees/FenwickTree.java:8
MethodIndexableSkipList
()
data_structures/IndexableSkipList.java:32
MethodLine
(Point p, Point q)
geometry/Line.java:9
MethodLineSegment
(Point a, Point b)
geometry/LineSegment.java:7
MethodNode
(int a, int b)
strings/AhoCorasick.java:14
MethodNode
(int x)
graphs/trees/TreeTraversal.java:7
MethodNode
(T k, int p, int s, Node<T> l, Node<T> r)
data_structures/TreapSet.java:13
MethodNode
(E val, int lvl, int ps, Node nxt, Node dwn)
data_structures/IndexableSkipList.java:16
MethodNode
(T v, int l, Node n, Node d)
data_structures/SkipList.java:14
MethodNode
(int x)
data_structures/trees/PersistentSegmentTree.java:9
MethodPoint
(int a, int b)
geometry/LineSweep.java:44
MethodPoint
(double a, double b)
geometry/Point.java:9
MethodPolygon
(Point[] o)
geometry/Polygon.java:12
MethodPolynomial
(int[] c)
math/Polynomial.java:9
MethodQuadTree
(int[][] in, int n)
data_structures/trees/QuadTree.java:53
MethodQuery
(int a, int b, int c)
data_structures/MoAlgorithm.java:45
MethodRectangle
(Point a, Point b)
geometry/Rectangle.java:9
MethodSCC
()
graphs/traversal/KosarajuAlgorithm.java:17
MethodScanner
(InputStream s)
other_algorithms/Scanner.java:14
MethodSegmentTree
(int[] in)
data_structures/HLD.java:200
MethodSegmentTree
(int[] in)
data_structures/trees/SegmentTree.java:12
MethodSegmentTree2D
(int[][] a)
data_structures/trees/SegmentTree2D.java:9
MethodSkipList
()
data_structures/SkipList.java:28
MethodSparseTable
(int[] A)
data_structures/SparseTable.java:8
MethodSuffixArray
(char[] s)
strings/SuffixArray.java:7
MethodSuffixAutomaton
(char[] s)
strings/SuffixAutomaton.java:11
MethodTriangle
(Point p, Point q, Point r)
geometry/Triangle.java:10
MethodUnionFind
(int N)
graphs/mst/MST_Kruskal.java:34
MethodUnionFind
(int N)
data_structures/UnionFind.java:8
MethodVector
(double a, double b)
geometry/Vector.java:7
Methodadd
(E val, int index)
data_structures/IndexableSkipList.java:80
MethodaddEdge
(int u, int v)
graphs/traversal/BridgesOnline.java:52
MethodaddLine
(long a, long b)
other_algorithms/ConvexHullOptimization2.java:19
MethodaddLine
(long a, long b)
other_algorithms/ConvexHullOptimization1.java:19
MethodaddString
(char[] s)
strings/AhoCorasick.java:32
MethodarcLength
(double deg)
geometry/Circle.java:23
Methodarea
()
geometry/Rectangle.java:11
Methodarea2
()
geometry/Triangle.java:30
Methodarea3
()
geometry/Triangle.java:39
MethodareaHeights
(double ha, double hb, double hc)
geometry/Triangle.java:83
MethodareaMedians
(double ma, double mb, double mc)
geometry/Triangle.java:77
MethodbellmanFord
(int S)
graphs/shortest_path/SSSP.java:43
Methodbfs
(int s, int t)
graphs/traversal/GraphTraversal.java:43
MethodbipartitieCheck
(int u)
graphs/traversal/GraphTraversal.java:93
MethodbridgeTree
()
graphs/traversal/BridgeTree.java:13
Methodbuild
(int[] a, int l, int r)
data_structures/trees/PersistentSegmentTree.java:22
MethodbuildTree
(int[] post, int[] in, int[] idxOf)
graphs/trees/TreeTraversal.java:10
Methodcentroid
()
geometry/Polygon.java:112
MethodchordLength
(double deg)
geometry/Circle.java:25
MethodcircumCircle
()
geometry/Triangle.java:62
MethodclearBit
(int S, int j)
data_structures/linear/Bitmask.java:7
Methodcollinear
(Point p, Point q, Point r)
geometry/Point.java:77
Methodcompare
(Point o1, Point o2)
geometry/LineSweep.java:53
MethodcompareTo
(Point p)
geometry/LineSweep.java:46
MethodcompareTo
(Edge e)
graphs/mst/MST_Prim.java:37
MethodcompareTo
(Edge e)
graphs/mst/MST_Kruskal.java:28
MethodcompareTo
(Edge e)
graphs/shortest_path/SSSP.java:75
MethodcomputeLog
()
other_algorithms/Precomputation.java:22
MethodconvexHull
(Point[] points)
geometry/Polygon.java:87
MethodcountCoprime
(int n, int r)
math/combinatorics/InclusionExclusionPrinciple.java:11
MethodcountHarmonic
(int n)
math/combinatorics/InclusionExclusionPrinciple.java:44
MethodcutPolygon
(Point a, Point b)
geometry/Polygon.java:64
Methoddelete
(K key)
data_structures/TreapSet.java:36
Methoddfs2
(int i, int j)
graphs/traversal/GraphTraversal.java:121
Methoddijkstra
(int S, int T)
graphs/shortest_path/SSSP.java:19
Methoddinic
()
graphs/max_flow/MaxFlow2.java:15
MethoddistToLineSegment
(Point p, Point a, Point b)
geometry/Point.java:99
MethodedgeType
(int u)
graphs/traversal/GraphTraversal.java:65
MethodedmondsKarp
()
graphs/max_flow/MaxFlow1.java:19
MethodeulerWalk
(int root)
graphs/trees/EulerWalk.java:25
MethodextendedEuclid
(int a, int b)
math/number_theory/ExtendedEuclid.java:21
Methodfibonacci
(int n)
math/combinatorics/Fibonacci.java:7
MethodfindArtPointsAndBridges
()
graphs/traversal/ArticulationPointsAndBridges.java:15
MethodfindCenter
(Point p, Point q, double r)
geometry/Circle.java:64
MethodfindGreatestRoot
()
math/Polynomial.java:29
MethodfindIndex
(int cumFreq)
data_structures/trees/FenwickTree.java:42
MethodfindRoot
()
graphs/trees/TreeDiameter.java:71
MethodfindWinner
()
math/game_theory/PoliceAndThief.java:22
Methodfloyd
()
graphs/shortest_path/APSP.java:12
← previousnext →101–200 of 309, ranked by callers