#Data Structures Final Project This Project is for my Data Structures Final Project. It is a Todo list which is a hybrid of a stack and a que. Depending weather the item is of high priority it will push it to the stack, if it is a low priority it will enque it at the back. Once taskes are compleated you can remove them from the que.
Fork branch
Use git clone + url of your forked branch (not https://github.com/Andrew-Casner/DataStructuresFinalProject)
In terminal run g++ -std=c++11 driver.cpp then ./a.out
Built to run on linuix
No external dependancies
Commands
add -Adds a new todo item
todo -Shows all items in the todo list
next -Shows the next item needed todo
done -You have compleated the next item
find -Finds if you have that item in your todo list
- Fork repo
- Create your feature branch:
git checkout -b my-new-feature - Commit your changes:
git commit -am 'Add some feature' - Push to the branch:
git push origin my-new-feature - Submit a pull request
Started by Andrew Casner in April of 2016
None as of 4/27
Created by Andrew Casner
Contributers:
MIT License