https://github.com/steliospapamichail/amongusmvp

A command line Among Us MVP game
https://github.com/steliospapamichail/amongusmvp

among-us computer-science cpp data-structures linked-list tree-structure

Last synced: 8 months ago
JSON representation

A command line Among Us MVP game

• Host: GitHub
• URL: https://github.com/steliospapamichail/amongusmvp
• Owner: SteliosPapamichail
• License: gpl-3.0
• Created: 2020-11-21T10:41:53.000Z (over 5 years ago)
• Default Branch: main
• Last Pushed: 2022-02-11T11:54:27.000Z (over 4 years ago)
• Last Synced: 2025-02-23T23:30:34.333Z (over 1 year ago)
• Topics: among-us, computer-science, cpp, data-structures, linked-list, tree-structure
• Language: C++
• Homepage:
• Size: 724 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# AmongUsMVP

A command line "Among Us" MVP built as a Project for the HY-240 Course on Data Structures of the University of Crete , Department of computer science.

This project consists of two Phases ("Phase A" & "Phase B"). Its purpose is to demonstrate my knowledge and experimentation in creating some of the basic data structures in C++ from scratch. More specifically:

## Phase A

This phase consists of the following data structures which are used to store various data of the game:

 Doubly Linked List with sentinel (used for storing Players) 

 Sorted linked list (used for storing player tasks) 


For a detailed explanation of the project, how to compile and run it, see the [Instructions](Phase%20A/phaseA_instructions.pdf) file for phase A, owned by the instructor of the HY-240 Data Structures class Panagiota Fatourou (Course website).

## Phase B

This phase consists of the following data structures which are used to store various data of the game:

 Doubly Linked Binary Search Tree with sentinel (used for storing Players) 

 Binary Search Tree with the counter property (each node contains an lCnt that stores the number of children in its left subtree) (used for storing player tasks) 

 Hash table using Global Hashing & separate chaining (used to store tasks in the general tasks table) 

 Max priority queue (stores completed tasks) 


For a detailed explanation of the project, how to compile and run it, see the [Instructions](Phase%20B/phaseB_instructions.pdf) file for phase B, owned by the instructor of the HY-240 Data Structures class Panagiota Fatourou (Course website).

### Improtant Note

The provided pdfs are property of Panagiota Fatourou and the UOC.