【数据结构与算法】实验 Dijkstra算法和Prim算法解决欧洲旅行问题

Experiment 4 Europe by Rail（4 hours）

Prerequisites: Students should have mastered the following prerequisite skills.

• Graphs - Knowledge of graph representation, particularly adjacency lists
• Graph Algorithms - Knowledge of Dijkstra’s shortest path algorithm

Goals: This assignment is designed to reinforce the student’s understanding of the implementation of a fundamental graph algorithm

Outcomes: Students successfully completing this assignment would master t