matching-algorithm

Ultra-fast matching engine written in Java based on LMAX Disruptor, Eclipse Collections, Real Logic Agrona, OpenHFT, LZ4 Java, and Adaptive Radix Trees.

I have written some important Algorithms and Data Structures in an efficient way in Java with proper references to time and space complexity. These Pre-cooked and well-tested codes help to implement larger hackathon problems in lesser time. DFS, BFS, LCA, All Pair Shortest Path, Longest Common Subsequence, Binary Search, Lower Bound Search, Maximal Matching, Matrix Exponentiation, Segment Tree, Sparse Table, Merge Sort, Miller Prime Test, Prims - Minimum Spanning Tree, BIT - Binary Index Tree, Two Pointers, BST - Binary Search Tree, Maximum Subarray Sum, Immutable Data Structures, Persistent Data Structurs - Persistent Trie, Dijkstra, Z - Function, Minimum Cost Maximal Matching, Heavy Light Decomposition, Knapsack, Suffix Array and LCP - Longest Common Prefix, Squre Root Decomposition, Kth Order Statics, Trie / Prefix Tree, LIS - Longest Increasing Subsequence, Hashing

C++ implementation of algorithms for finding perfect matchings in general graphs

Simple string matching with questionmark- and star-wildcard operator

Edge Based Template Matching

This repository implements skeleton matching algorithm.

A toolbox for solving problems of equilibrium computation and identification in discrete choice and matching problems.

Matching algorithms for LightGraphs.jl

Superfast Matching Engine written in golang

Another implementation of stock matching engine which uses binary heaps to store prices in bid/ask order books, and balances the orders recursively.

Exchange Server

Christian Dior 💃🕺👗👔📈📉 - (Order Matching Engine) - match hundreds of thousands of orders per second

The is the dynamic matching code for the paper ``Dynamic Matching in Practice''.

A Julia implementation of the Blossom V matching algorithm

R package for matching algorithm in causal inference

A Python implementation of Edmond's blossom algorithm to find maximum matchings in general graphs

Atlas name matching API and index generation

Unsupervised Product Matching; A product classifier algorithm that groups products into clusters of similarity based on their title using combinations.

A web application designed to match mentors and students based on a series of survey, personality-related, questions.

Graph theory for car-pool problem

A command line tool and Python library for converting lists of strings into matching regular expressions (finite automata).

A python implementation of Edmonds blossom algorithm for maximum-cardinality matching.

My implementation of parallel b-suitors algorithm created for Concurrent Programming course at University of Warsaw (2017/2018)

PyTorch implementation of Class Agnostic Counting model

Network Protocol Declaration Language

A MatchMaker Exchange server

This is a matching algorithm for a casual chat program used during the summer of 2020 to connect students in the Engineering Physics Class of 2023, also used for secret santa in December of 2020

A Indian currency note detection algorithm using feature extraction and matching algorithm.

Find maximum matchings in an arbitrary bipartite graphs with Node.js and React.js