{'fraction_non_alphanumeric': 0.017716535433070866, 'fraction_numerical': 0.0, 'mean_word_length': 5.316770186335404, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Experimental Teaching Platform Development for Topological Sorting Algorithm Education

Job shop Scheduling Problem is an NP-hard combinatorial optimization problem. The research on its solving algorithm has been a hot topic, and many achievements have been made. However, due to the complexity of time and variable space in the solving process of job shop scheduling problems, teaching tools of scheduling algorithms are still lacking. To solve the problem, this paper takes a topological sorting algorithm to illustrate the design principle and solving instances of the scheduling algorithm for job shop scheduling problems. Firstly, the method of using a graph to express the correlation between operations is described. Secondly, the idea of the topological sorting algorithm for job shop scheduling is proposed, and the steps of algorithm programming are explained in detail. Thirdly, based on the case, the solving performance of the algorithm is analyzed, and the solving effect of the algorithm is expounded.