能够存储和表示给定拓扑结构

2) 能够实现Dijkstra和Bellman-ford算法

3) 根据指定结点，生成路由表并演示算法每一步执行情况

4) 加分项目：GUI界面演示所有信息

-Ability to store and represent a given topology 2) to achieve Dijkstra algorithm and Bellman-ford 3) according to a specified node, the algorithm generates a routing table and demonstrates the implementation of each step 4) extra points: GUI interface demo all the information