mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-02-03 02:25:57 +08:00
06b6714b0e
* Hopcroft–Karp algorithm implementation The Hopcroft–Karp algorithm is an algorithm that takes as input a bipartite graph and produces as output a maximum cardinality matching. * Update hopcroft_karp.cpp * fix : fixed the issues * Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update hopcroft_karp.cpp Added Global variable as private variable * Update hopcroft_karp.cpp * Update hopcroft_karp.cpp * Update hopcroft_karp.cpp * Update hopcroft_karp.cpp * Update hopcroft_karp.cpp * Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update hopcroft_karp.cpp * Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * updating DIRECTORY.md * Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * clang-tidy fixes for780580f71f* Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * clang-tidy fixes for03f97cb241* Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/hopcroft_karp.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/hopcroft_karp.cpp Co-authored-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * Update graph/hopcroft_karp.cpp Co-authored-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * Update graph/hopcroft_karp.cpp Co-authored-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * Update graph/hopcroft_karp.cpp Co-authored-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * applied suggested changes Co-authored-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * Update graph/hopcroft_karp.cpp Co-authored-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * applied changes Co-authored-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * Update graph/hopcroft_karp.cpp Co-authored-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * improved documentation Co-authored-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * Update graph/hopcroft_karp.cpp Co-authored-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * Update graph/hopcroft_karp.cpp Co-authored-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * Update hopcroft_karp.cpp * corrected code * Update hopcroft_karp.cpp * changed the class name * applied suggested changes included the HKGraph class and it's member functions inside namespace graph * Update graph/hopcroft_karp.cpp Co-authored-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * Update hopcroft_karp.cpp * Update hopcroft_karp.cpp * added sample test cases * Update DIRECTORY.md Co-authored-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * Update DIRECTORY.md Co-authored-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * updating DIRECTORY.md Co-authored-by: David Leal <halfpacho@gmail.com> Co-authored-by: @8848hg <53469557+Himalay12@users.noreply.github.com> Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com>
26 KiB
26 KiB
List of all files
Backtracking
- Graph Coloring
- Knight Tour
- Minimax
- N Queens
- N Queens All Solution Optimised
- Nqueen Print All Solutions
- Rat Maze
- Sudoku Solve
Ciphers
Data Structures
- Avltree
- Binary Search Tree
- Binaryheap
- Circular Queue Using Linked List
- Cll
- Disjoint Set
- Doubly Linked List
- Linked List
- Linkedlist Implentation Usingarray
- List Array
- Morrisinorder
- Queue
- Queue Using Array
- Queue Using Array2
- Queue Using Linked List
- Queue Using Linkedlist
- Queue Using Two Stacks
- Skip List
- Stack
- Stack Using Array
- Stack Using Linked List
- Test Queue
- Test Stack
- Test Stack Students
- Tree
- Trie Modern
- Trie Tree
Dynamic Programming
- 0 1 Knapsack
- Armstrong Number
- Bellman Ford
- Catalan Numbers
- Coin Change
- Cut Rod
- Edit Distance
- Egg Dropping Puzzle
- Fibonacci Bottom Up
- Floyd Warshall
- Kadane
- Kadane2
- Longest Common String
- Longest Common Subsequence
- Longest Increasing Subsequence
- Longest Increasing Subsequence (Nlogn)
- Matrix Chain Multiplication
- Searching Of Element In Dynamic Array
- Shortest Common Supersequence
- Tree Height
Geometry
Graph
- Breadth First Search
- Bridge Finding With Tarjan Algorithm
- Connected Components
- Connected Components With Dsu
- Cycle Check Directed Graph
- Depth First Search
- Depth First Search With Stack
- Dijkstra
- Hamiltons Cycle
- Hopcroft Karp
- Is Graph Bipartite
- Kosaraju
- Kruskal
- Lowest Common Ancestor
- Max Flow With Ford Fulkerson And Edmond Karp Algo
- Prim
- Topological Sort
- Topological Sort By Kahns Algo
Graphics
Greedy Algorithms
Hashing
Machine Learning
- Adaline Learning
- Kohonen Som Topology
- Kohonen Som Trace
- Neural Network
- Ordinary Least Squares Regressor
- Vector Ops
Math
- Armstrong Number
- Binary Exponent
- Check Amicable Pair
- Check Factorial
- Check Prime
- Complex Numbers
- Double Factorial
- Eulers Totient Function
- Extended Euclid Algorithm
- Factorial
- Fast Power
- Fibonacci
- Fibonacci Fast
- Fibonacci Large
- Gcd Iterative Euclidean
- Gcd Of N Numbers
- Gcd Recursive Euclidean
- Large Factorial
- Large Number
- Least Common Multiple
- Miller Rabin
- Modular Inverse Fermat Little Theorem
- Number Of Positive Divisors
- Power For Huge Numbers
- Prime Factorization
- Prime Numbers
- Primes Up To Billion
- Realtime Stats
- Sieve Of Eratosthenes
- Sqrt Double
- String Fibonacci
- Sum Of Digits
Numerical Methods
- Bisection Method
- Brent Method Extrema
- Durand Kerner Roots
- False Position
- Gaussian Elimination
- Golden Search Extrema
- Lu Decompose
- Lu Decomposition
- Newton Raphson Method
- Ode Forward Euler
- Ode Midpoint Euler
- Ode Semi Implicit Euler
- Qr Decompose
- Qr Decomposition
- Qr Eigen Values
- Successive Approximation
Operations On Datastructures
- Array Left Rotation
- Array Right Rotation
- Circular Linked List
- Circular Queue Using Array
- Get Size Of Linked List
- Intersection Of 2 Arrays
- Reverse A Linked List Using Recusion
- Selectionsortlinkedlist
- Union Of 2 Arrays
Others
- Buzz Number
- Decimal To Binary
- Decimal To Hexadecimal
- Decimal To Roman Numeral
- Fast Integer Input
- Happy Number
- Matrix Exponentiation
- Palindrome Of Number
- Paranthesis Matching
- Pascal Triangle
- Postfix Evaluation
- Primality Test
- Smallest Circle
- Sparse Matrix
- Spiral Print
- Stairs Pattern
- Tower Of Hanoi
- Vector Important Functions
Probability
Range Queries
Search
- Binary Search
- Exponential Search
- Fibonacci Search
- Hash Search
- Interpolation Search
- Interpolation Search2
- Jump Search
- Linear Search
- Median Search
- Ternary Search
- Text Search
Sorting
- Bead Sort
- Bitonic Sort
- Bogo Sort
- Bubble Sort
- Bucket Sort
- Cocktail Selection Sort
- Comb Sort
- Counting Sort
- Counting Sort String
- Gnome Sort
- Heap Sort
- Insertion Sort
- Library Sort
- Merge Insertion Sort
- Merge Sort
- Non Recursive Merge Sort
- Numeric String Sort
- Odd Even Sort
- Pigeonhole Sort
- Quick Sort
- Quick Sort 3
- Radix Sort
- Selection Sort
- Shell Sort
- Shell Sort2
- Slow Sort
- Strand Sort
- Swap Sort
- Tim Sort