{"id":20137452,"url":"https://github.com/steliospapamichail/amongusmvp","last_synced_at":"2026-07-03T22:05:04.202Z","repository":{"id":154295369,"uuid":"314788125","full_name":"SteliosPapamichail/AmongUsMVP","owner":"SteliosPapamichail","description":"A command line Among Us MVP game","archived":false,"fork":false,"pushed_at":"2022-02-11T11:54:27.000Z","size":741,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-23T23:30:34.333Z","etag":null,"topics":["among-us","computer-science","cpp","data-structures","linked-list","tree-structure"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/SteliosPapamichail.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-11-21T10:41:53.000Z","updated_at":"2022-02-11T11:56:32.000Z","dependencies_parsed_at":null,"dependency_job_id":"d94534fb-d5c2-4615-a804-4822fa77164d","html_url":"https://github.com/SteliosPapamichail/AmongUsMVP","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SteliosPapamichail%2FAmongUsMVP","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SteliosPapamichail%2FAmongUsMVP/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SteliosPapamichail%2FAmongUsMVP/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SteliosPapamichail%2FAmongUsMVP/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/SteliosPapamichail","download_url":"https://codeload.github.com/SteliosPapamichail/AmongUsMVP/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241582555,"owners_count":19985845,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["among-us","computer-science","cpp","data-structures","linked-list","tree-structure"],"created_at":"2024-11-13T21:27:46.698Z","updated_at":"2025-10-28T13:32:31.346Z","avatar_url":"https://github.com/SteliosPapamichail.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# AmongUsMVP\nA 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.\n\nThis project consists of two Phases (\"Phase A\" \u0026 \"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:\n\n## Phase A\n\nThis phase consists of the following data structures which are used to store various data of the game:\n\n\u003cli\u003e Doubly Linked List with sentinel (used for storing Players) \u003c/li\u003e\n\u003cli\u003e Sorted linked list (used for storing player tasks) \u003c/li\u003e\n\nFor 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 (\u003ca href=\"https://www.csd.uoc.gr/~hy240/current/index.php\"\u003eCourse website\u003c/a\u003e).\n\n\n## Phase B\n\nThis phase consists of the following data structures which are used to store various data of the game:\n\n\u003cli\u003e Doubly Linked Binary Search Tree with sentinel (used for storing Players) \u003c/li\u003e\n\u003cli\u003e 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) \u003c/li\u003e\n\u003cli\u003e Hash table using Global Hashing \u0026 separate chaining (used to store tasks in the general tasks table) \u003c/li\u003e\n\u003cli\u003e Max priority queue (stores completed tasks) \u003c/li\u003e\n\n\nFor 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 (\u003ca href=\"https://www.csd.uoc.gr/~hy240/current/index.php\"\u003eCourse website\u003c/a\u003e).\n\n\n### Improtant Note\nThe provided pdfs are property of Panagiota Fatourou and the UOC.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsteliospapamichail%2Famongusmvp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsteliospapamichail%2Famongusmvp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsteliospapamichail%2Famongusmvp/lists"}