Non euclidean geometry bok11/10/2023 ![]() January 16, 2022: Switched to the MkDocs site generator with the Material for MkDocs theme, which give the website a more modern look, brings a couple of new features (dark mode, better search.The navigation is moved to a separate page and its structure should be adjusted in navigation.md whenever a new article is created or an old one is moved. June 5, 2022: Enabled content tabs and sidebar navigation.June 7, 2022: Date of last commit and author list with contribution percentage is tracked for each page.For translated articles, clicking on From: X tag would lead to the original article. Each article is now marked whether it is translated or original, overall tag info is present in the tag index. October 31, 2022: It is now possible to select and copy $\LaTeX$ source code of formulas within the articles.It is recommended to update the upstream link in your local repositories, if you have any. December 20, 2022: The repository name and the owning organizations were renamed! Now the repo is located at.June 26, 2023: Added automatic RSS feeds for new articles and updates in articles.Moreover we want to improve the collected knowledge by extending the articlesĪnd adding new articles to the collection.Ĭompiled pages are published at. which provides descriptions of many algorithmsĪnd data structures especially popular in field of competitive programming. The goal of this project is to translate the wonderful resource JanuAlgorithms for Competitive Programming ¶ The Stern-Brocot Tree and Farey Sequences Tortoise and Hare Algorithm (Linked List cycle detection)ġ5 Puzzle Game: Existence Of The Solution Optimal schedule of jobs given their deadlines and durations MEX task (Minimal Excluded element in an array) Search the subsegment with the maximum/minimum sum RMQ task (Range Minimum Query - the smallest element in an interval) Kuhn's Algorithm - Maximum Bipartite Matching Maximum flow - Push-relabel algorithm improved Maximum flow - Ford-Fulkerson and Edmonds-Karp Lowest Common Ancestor - Tarjan's off-line algorithm Lowest Common Ancestor - Farach-Colton and Bender algorithm Second best Minimum Spanning Tree - Using Kruskal and Lowest Common AncestorĬhecking a graph for acyclicity and finding a cycle in O(M) Minimum Spanning Tree - Kruskal with Disjoint Set Union Number of paths of fixed length / Shortest paths of fixed length Strongly Connected Components and Condensation Graphĭijkstra - finding shortest paths from given vertexīellman-Ford - finding shortest paths with negative weightsįloyd-Warshall - finding all shortest paths Half-plane intersection - S&I Algorithm in O(N log N)Ĭonnected components, bridges, articulations points Search for a pair of intersecting segmentsĭelaunay triangulation and Voronoi diagram Pick's Theorem - area of lattice polygons Manacher's Algorithm - Finding all sub-palindromes in O(N)īurnside's lemma / Pólya enumeration theoremįinding the equation of a line for a segmentĬheck if points belong to the convex polygon in O(log N) Euclidean algorithm for computing the greatest common divisorĭeleting from a data structure in O(T(n) log n)ĭynamic Programming on Broken Profile.
0 Comments
Leave a Reply.AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |