I think I should be ok to share this and no-body will get mad.
The GitHub link above takes you to a repo containing the starter code and test cases for a sample assignment given when I was a TA. This assignment tests student's on implementing a topological ordering on a directed graph in C++. The graph is (recommended to be) done via `std::unordered_map` and `std::vector`. The test cases use some given graphs and then also randomly generate graphs with certain properties (disjoint, cycles) to test the edge cases of the student's implementation. Of course, the test cases are written to accept any ordering produced by the students and can validate that this is a valid topological ordering. The test cases are written in Google Test since this assignment ran on Mimir.