高斯消元法，可以随意改变方程组的行列数，用数组来存储矩阵的系数-Gaussian elimination, can be changed at the ranks of the number of equations, using an array to store the coefficient matrix

用拓扑排序、邻接矩阵存储 结构建图、for语句的灵活运用，栈及数组来实现最短路径问题-Topological sorting adjacency matrix storage structure building plans, the flexible use of the for statement, stacks and arrays to achieve the shortest path problem