Added sample input
basic input and output
clear the sticker array between cases
stubbed out methods for algorithm. I will create edges to represent a sticker that could be moved from one person to another. Once all of the edges are created, I will try to find cycles that start and end at Bob. When there are no cycles remaining, the process is complete.
Did some major refactoring. The program is going into an infinite loop when given the sample input
Got rid of the infinite loop.
Changed the loop so that cycles can be found, while still preventing infinite loops.
Another major refactor. Using an array to represent all the posible trades instead of vertex and edge objects
Moved the code that resets the graph to the correct spot. Added a print statement for debug.
Moved cleanup code to a teardown method
Stubbed out method to update sticker counts
Fixed bugs in the getCycle method. Added print statement for debug.
Stickers are one indexed
Updated more code for the one indexed stickers. removed debug print statements
Put the count code into a method
Deleted a method that had a confusing name and made some super triangle code!
moved the order of methods for clarity
Added README. TLE...