利用邻接矩阵构造一张欧洲交通图，并求出某一城市到其余城市的最少票价路径或者最短里程路径，并打印输出。

程序执行的命令包括：

（1）初始化交通网络图并根据文件构造欧洲交通图；（2）用户先后输入“最优方式”和“始末城市名称”；（3）程序执行相关操作，打印出用户所需的信息；（4）结束。

-Adjacency matrix structure the use of a European transport plans, and obtained a city to the rest of the city or at least the shortest path fare mileage path, and print output. Procedures for the implementation of the order include: (1) to initialize the transport network map and in accordance with the European transport plan document structure　(2) the user has input