Abstract: Discrete mathematics is an important professional basic course for computer science in which the Graph- theory is the focus of the content and the shortest path algorithm is the most difficult part for students to learn. A detailed analysis of the shortest path algorithm is conducted and the task-driven teaching design is provided based on the teaching cases and teaching experiences, which is to benefit the teaching and learning of the contents.

Key words: Discrete Mathematics, Graph- theory, shortest path, teaching design