Determining Optimal Character Memorization Order
Summary: In this assignment, you will implement a topologicalsort algorithm as a way to reorder kanji (漢字; Japanese logographiccharacters) into an order optimal for memorization.
2 Requirements [60 points, 8 extra credit]
In this assignment, you will implement an editable graph datastructure and a new algorithm for finding the topological sort of agraph. Our goal will be to load two data files, and print out atopological order for the characters that they list. Attached tothis post are a base file and two interfaces. Further down theBlackBoard page, you’ll find a PDF describing the Javaimplementation of hashtables (you may
OR
OR