At the invitation of Cuiying College, on the evening of September 22, Professor Xu Shoujun from the School of Mathematics and Statistics gave an academic report entitled "Search Algorithm for Graphs" to Cuiying College students.

Professor Xu Shoujun first expressed his gratitude for the sincere invitation of Cuiying College. At the beginning of the report, he asked the students the question "How does the navigation software determine the optimal path plan?" During the report process, he abstracted the map into a map, introduced the two most basic search ideas to his classmates in a simple and simple way-depth-first search and breadth-first search, clarified the differences, advantages and disadvantages of the two algorithms, and introduced the famous Dijkstra Algorithm principle. Afterwards, he introduced the current popular A* algorithm and the principle of the greedy algorithm, and vividly demonstrated the difference of the search mode of each algorithm with the program. Finally, he talked about his research direction and work experience, and encouraged everyone to actively explore their fields of interest, work hard to develop their skills and become top talents.

(Translated by He Yipeng, proofread by Bian Yujing and Li Shuowen.)