Description: Traversal of graphs; Find the minimum cost spanning tree of communication network. Input an undirected railway traffic map, starting station and terminal, and use Dijkstra algorithm to calculate the shortest path from the starting station to the terminal.