initial commit
first crack at making graph data structure
added rapidjson library and updated makefile
added in code for JSON
successfully parsed data
got json output working
cleaned from last build
added functionaly for priority values (floats) for preferences
compressed third party library into tar.gz
began to add _makeSquare() sub-routine.  Needs testing.
Created testing directory.  Fixed error with file input.  Tested _makeSquare() (seems to work as expected)
added and did basic testing for _reduce() subroutine
made algorithm to draw the least number of lines to cover the zero entries of the matrix, but it is not efficient.  TODO: write a more efficient implementation of _addLines().  The problem with the priority queue method is that it can't deal with the fact that rows and columns loose 0's (and thus change rank) when lines are drawn on intersecting rows and columns.
Created a unit cost search algorithm to find potential assignments.  It will also allow me to "draw the minimum number of lines" if an assignment is not possible.  TODO:  add admissible heuristic to speed up unit cost search.
changed line drawing algorithm to work using results from unit cost assignment
finished writing method for assignment.  First full test run passed on test_input/test7_in.json.  Ready for first push to GitHub.
Merge branch 'master' of https://github.com/kkleidal/HungarianAlgorithm
Merging to upload to github