仅考虑公汽线路，给出任意两公汽站点之间线路选择问题的一般数学模型与算法。并根据附录数据，利用你们的模型与算法，求出以下6对起始站→终到站之间的最佳路线。利用最优化原理，建立出一个动态规划模型，并运用广度优先的算法，在模型和算法的基础上，通过迭代的思想，实现用基于选取换乘K-1次路线的方法得到换乘K次的路线-Consider only the bus line, given a choice between any two lines for the bus station issue general mathematical model and algorithms. And in accordance with Appendix data, use your model and algorithm obtains the following six pairs starting station → best route between the final station. The use of optimization theory, establish a dynamic programming model, and use breadth-first algorithm, based on models and algorithms, iterative thinking, implemented by K-1 based on the selected sub-route transfer method to get the transfer K times route