Overall, this was a fun project that I felt challenged my abilities. The biggest thing I took out of this project was how to use multiple Array Lists to effectively build a Directed Graph. Once, I figured out how to build all the appropriate variables, I had some trouble at first understanding how to topologically order the graph. Once I did some more research on depth-first search algorithms and re-read some of the readings from week seven, I could then implement the dfs algorithm correctly. I also felt a lot more comfortable when it came to generics on this project due to using them throughout the previous project. On a side note, my output for graph.txt is not the exact same as yours, however, after double and triple checking the readings, as well as my outputs, it looks as if it is still topologically ordered. So, my question is, how come this is the case? It is due to my implementation? As both the example result, and mine, look to be correct. I would love to know the answer/your thoughts on this! Lastly, I would just like to say that I thoroughly enjoyed this course, and the feedback you gave me throughout it. (On this project, I tried to improve the cohesiveness compared to last project, let me know if I took the right approach.) I can honestly say that I feel this has been the most beneficial CS course in my academic career so far! Thanks! Overall, this was a fun project that I felt challenged my abilities. The biggest thing I took out of this project was how to use multiple Array Lists to effectively build a Directed Graph. Once, I figured out how to build all the appropriate variables, I had some trouble at first understanding how to topologically order the graph. Once I did some more research on depth-first search algorithms and re-read some of the readings from week seven, I could then implement the dfs algorithm correctly. I also felt a lot more comfortable when it came to generics on this project due to using them throughout the previous project. On a side note, my output for graph.txt is not the exact same as yours, however, after double and triple checking the readings, as well as my outputs, it looks as if it is still topologically ordered. So, my question is, how come this is the case? It is due to my implementation? As both the example result, and mine, look to be correct. I would love to know the answer/your thoughts on this! Lastly, I would just like to say that I thoroughly enjoyed this course, and the feedback you gave me throughout it. (On this project, I tried to improve the cohesiveness compared to last project, let me know if I took the right approach.) I can honestly say that I feel this has been the most beneficial CS course in my academic career so far! Thanks