GitHub repository: bluedawnstar/algorithm_study

Issues:
issue_117: state: open
title: Reeds–Sloane algorithm
user: bluedawnstar
issue_107: state: open
title: Create adj_data.txt
user: arpitnits
issue_106: state: open
title: Create Karger_MinCut.cpp
user: arpitnits
issue_99: state: open
title: Check & implement nimber
user: bluedawnstar
issue_94: state: open
title: Check "Bostan-Gaudry-Schost"
user: bluedawnstar
issue_92: state: open
title: Review Push Relabel algorithm
user: bluedawnstar
issue_91: state: open
title: Review flow network algorithms
user: bluedawnstar
issue_90: state: open
title: Graph Transitive Closure
user: bluedawnstar
issue_89: state: open
title: Find a Mother Vertex in a Graph
user: bluedawnstar
issue_88: state: open
title: Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
user: bluedawnstar
issue_87: state: open
title: Minimum-weight closure
user: bluedawnstar
issue_86: state: open
title: Maximum density subgraph
user: bluedawnstar
issue_85: state: open
title: Number of solutions of linear equations
user: bluedawnstar
issue_84: state: open
title: Minkowski sum
user: bluedawnstar
issue_83: state: open
title: Levenstein automata
user: bluedawnstar
issue_81: state: open
title: Modular square root
user: bluedawnstar
issue_80: state: open
title: Review integer partition
user: bluedawnstar
issue_79: state: open
title: Review Grundy number
user: bluedawnstar
issue_78: state: open
title: Nth permutation
user: bluedawnstar
issue_75: state: open
title: Maximum Weighted Matching in General Graphs
user: bluedawnstar
issue_74: state: open
title: Improve suffix tree implementation
user: bluedawnstar
issue_73: state: open
title: Check and implement "Minimum cost flow in polynomial time"
user: bluedawnstar
issue_72: state: open
title: From expandable set to dynamic via O(log(n))
user: bluedawnstar
issue_71: state: open
title: Jacobi eigenvalue algorithm, Jacobi method for solving system of linear equations
user: bluedawnstar
issue_70: state: open
title: Minimum mean weight cycle algorithm
user: bluedawnstar
issue_69: state: open
title: Absolute p-center
user: bluedawnstar
issue_68: state: open
title: Algorithm for finding largest triangle in a convex polygon
user: bluedawnstar
issue_67: state: open
title: Bresenham's line and circle algorithms
user: bluedawnstar
issue_66: state: open
title: All-substrings common subsequence
user: bluedawnstar
issue_61: state: open
title: DP optimization (some tricks)
user: bluedawnstar
issue_60: state: open
title: Closest pair via sweep line
user: bluedawnstar
issue_59: state: open
title: Chinese postman problem
user: bluedawnstar
issue_58: state: open
title: Fast matrix multiplication
user: bluedawnstar
issue_57: state: open
title: DFA minimization
user: bluedawnstar
issue_56: state: open
title: NFA to DFA transformation
user: bluedawnstar
issue_55: state: open
title: Exact cover
user: bluedawnstar
issue_54: state: open
title: Graph isomorphism
user: bluedawnstar
issue_53: state: open
title: Finding Bridges Online
user: bluedawnstar
issue_52: state: open
title: KNN for competitive programming
user: bluedawnstar
issue_51: state: open
title: Review "Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications"
user: bluedawnstar
issue_50: state: open
title: Review top tree
user: bluedawnstar
issue_49: state: open
title: Review tree-related papers
user: bluedawnstar
issue_47: state: open
title: Hashing
user: bluedawnstar
issue_46: state: open
title: Check and implement "Dynamic subtree queries revisited: the Depth First Tour Tree"
user: bluedawnstar
issue_45: state: open
title: Simulated Annealing
user: bluedawnstar
issue_43: state: open
title: Matroid and Matroid intersection
user: bluedawnstar
issue_42: state: open
title: Zip Tree
user: bluedawnstar
issue_40: state: open
title: Matrix decomposition
user: bluedawnstar
issue_33: state: open
title: Check and implement
user: bluedawnstar
issue_31: state: open
title: Survey on Cactus Graph
user: bluedawnstar
issue_30: state: open
title: Fast flood-fill algorithm
user: bluedawnstar
issue_29: state: open
title: Check the materials
user: bluedawnstar
issue_26: state: open
title: Implement shortest path algorithm for DAG
user: bluedawnstar
issue_25: state: open
title: Implement Binomial Heap
user: bluedawnstar
issue_23: state: open
title: Implement segment tree with insertion and deletion operators
user: bluedawnstar
issue_21: state: open
title: Polynom division, evaluation, square root in O(n*log^2(n))
user: bluedawnstar
issue_20: state: open
title: Kth shortest path
user: bluedawnstar
issue_16: state: open
title: Implement scheduling algorithms
user: bluedawnstar
issue_15: state: open
title: Understand and Implement Burnside's lemma
user: bluedawnstar
issue_12: state: open
title: Implement basic computational geometry algorithms
user: bluedawnstar
issue_11: state: open
title: Implement RegExp
user: bluedawnstar