GitHub / AaronR-spec / Algorithms-and-data-structures-practice

Part one which is the use of a Queue implementation. Here user can use all the functions outlined in the ca doc. Functions. Enqueue, Dequeue, Size, Clear. Part Two which is the use of a Stack implementation. Here user can use all the functionality of the Stack outlined in ca doc. Functions. Push, Pop, Front, Size, Clear. Part Three which is the use of a Stack to validate a Xml file. Here user can enter the file name or path and displays valid or invalid.Prompts the user for the knights x,y starting pos and the target spot they would like to reach. calls the processes and prints the path using the struct

JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AaronR-spec%2FAlgorithms-and-data-structures-practice
PURL: pkg:github/AaronR-spec/Algorithms-and-data-structures-practice

Topics: algorithm-challenges, algorithms-and-data-structures, c-plus-plus, knight-tour, queue, stack, xml

• Files
• Readme
• Dependencies