TutorialBank's resources:

• A list of 208 topics extracted from the files, which will be used as the nodes for the co-occurrence graphs and for the prerequisite edges. The list of 208 topics was expanded to 227 topics, including common acronyms and different writing formats. Then, an id was assigned to each topic.
• A list of annotated prerequisites relations between topics above with the format $id1,id2,prereq$, where prereq is 1 if $id1$ is a prerequisite of $id2$ and 0 otherwise. Out of all the 43,056 possible prerequisite pairs, there are only 913 pairs with prereq equal to 1.