One of University of Advancing Technology's "Data Structures and Algorithms" (CSC382) course weekly assignment.
Basic implementation of a data structure representing a Twitter User, and a Twitter Data cluster of users with different relationships.
The intention is to utilize a Binary Tree data structure in C++ with supporting methods for adding, removing, and finding nodes of users with followers & subscribers.
There was also a requirement for calculating the shortest distance between two given nodes.
This course explores the specification and implementation of containers as abstract data types. Structures covered include strings, vectors, stacks, queues, sequential lists, binary trees, hashes and graphs. The course also investigates algorithm design and evaluation, such as sorting, search, recursion and algorithmic analysis. Students will use concepts from calculus within this course.
MIT License
Copyright (c) 2016 Nathan "Mordil" Harris
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.