R: Matching Algorithms in R and C++

# Matching Algorithms in R and C++

## Documentation for package ‘matchingR’ version 2.0.0

- DESCRIPTION file
- User guides, package vignettes and other documentation
- Package NEWS
- Package README

## Help Pages

cpp_wrapper_galeshapley | C++ wrapper for Gale-Shapley Algorithm
cpp_wrapper_galeshapley_check_stability | C++ Wrapper to Check Stability of Two-sided Matching
cpp_wrapper_irving | Computes a stable roommate matching
cpp_wrapper_irving_check_stability | Check if a matching solves the stable roommate problem
cpp_wrapper_ttc | Computes the top trading cycle algorithm
cpp_wrapper_ttc_check_stability | Check if a one-sided matching for the top trading cycle algorithm is stable
galeShapley | Gale-Shapley Algorithm: Stable Marriage Problem
galeShapley.checkPreferences | Check if preference order is complete
galeShapley.checkStability | Check if a two-sided matching is stable
galeShapley.collegeAdmissions | Gale-Shapley Algorithm: College Admissions Problem
galeShapley.marriageMarket | Gale-Shapley Algorithm: Stable Marriage Problem
galeShapley.validate | Input validation of preferences
rankIndex | Rank elements within column of a matrix
repcol | Repeat each column of a matrix n times
reprow | Repeat each row of a matrix n times
roommate | Compute matching for one-sided markets
roommate.checkPreferences | Check if preference order for a one-sided market is complete
roommate.checkStability | Check if a roommate matching is stable
roommate.validate | Input validation for one-sided markets
sortIndex | Sort indices of a matrix within a column
sortIndexOneSided | Ranks elements with column of a matrix, assuming a one-sided market.
toptrading | Compute the top trading cycle algorithm
toptrading.checkStability | Check if there are any pairs of agents who would rather swap houses with each other rather than be with their own two current respective partners.