################################################################################
#
# PLEASE READ THIS FILE FIRST. 
#
# The comments below are related to all the files contained in this folder.
#
# This is the implementation of Kuhn-Munkres Hungarian algorithm written in C++
# and utilizes STL as main data structures. The algorithm assumes the input a 
# MAXIMIZATION problem and finds the maximal ouputs (including the optimality 
# and the matching pairs) through manipulating the bipartite graph.
# 
# NOTE that, the time complexity of this implementation could be more than 
# O(N^3) but should be less than O(N^4), due to simple data structure used. 
# Time can still be improved.
#
# You can freely use this code, and we are grateful if you can cite our work:
# Lantao Liu, Dylan Shell. "Assessing Optimal Assignment under Uncertainty: i
# An Interval-based Algorithm". International Journal of Robotics Research (IJRR). 
# vol. 30, no. 7, pp 936-953. Jun 2011.
#
# Or other related work posted on my page: 
# http://robotics.usc.edu/~lantao/codes/hungarian.php
#
# Lantao Liu, <lantao@cse.tamu.edu>
# Dept. of Computer Science and Engineering, 
# Texas A&M University, TX, 77843-3112.
#
################################################################################

