<div><select id="selProvince" onchange="changeCity()"><option></option></select><select id="selCity" onchange="changeArea()"><option></option></select><select id="selArea"><option></option></select></div><script>function changeCity() {var Province = $("#selProvince").val();//取数，取出该省对应的市var data = getData(Province);//绑定选择城市下拉选择项
            bindCity(data);//清空县下拉选择项和值
            clearArea();}function changeArea() {var City = $("#selCity").val();//取数，取出该市对应的县var data = getData(City);//绑定选择县下拉选择项
            bindArea(data);}</script>

static int M = 6;static void Main(string[] args){int[,] dist = new int[6, 6]{{int.MaxValue,1,1,int.MaxValue,int.MaxValue,int.MaxValue},{int.MaxValue,int.MaxValue,1,int.MaxValue,int.MaxValue,int.MaxValue},{int.MaxValue,int.MaxValue,int.MaxValue,int.MaxValue,int.MaxValue,1},{int.MaxValue,int.MaxValue,1,int.MaxValue,int.MaxValue,int.MaxValue},{int.MaxValue,int.MaxValue,int.MaxValue,int.MaxValue,int.MaxValue,int.MaxValue},{int.MaxValue,int.MaxValue,int.MaxValue,int.MaxValue,int.MaxValue,int.MaxValue}};int[,] g = new int[6, 6];Floyd(dist, g);PrintGraph(g, M);Console.Read();}/// <summary>/// 输出最短路径矩阵/// </summary>/// <param name="g"></param>/// <param name="v"></param>public static void PrintGraph(int[,] g, int v){for (int i = 0; i < v; i++){for (int j = 0; j < v; j++){if (g[i, j] == int.MaxValue)Console.Write("*" + " ");elseConsole.Write(g[i, j] + " ");}Console.WriteLine();}}/// <summary>/// Floyd最短路径算法/// </summary>/// <param name="dist">邻接矩阵</param>/// <param name="D">最短路径</param>public static void Floyd(int[,] dist, int[,] D){//复制一份distfor (int i = 0; i < M; i++){for (int j = 0; j < M; j++){D[i, j] = dist[i, j];}}for (int k = 0; k < M; k++){for (int i = 0; i < M; i++){for (int j = 0; j < M; j++){D[i, j] = Math.Min(D[i, j], (D[i, k] == int.MaxValue || D[k, j] == int.MaxValue) ? int.MaxValue : D[i, k] + D[k, j]);}}}}

  int[,] dest = new int[6, 6];dist = new int[6, 6]{{0,-1,-1,0,0,0},{0,0,-1,0,0,0},{0,0,0,0,0,-1},{0,0,-1,0,0,0},{0,0,0,0,0,0},{0,0,0,0,0,0}};Floyd_OneNode(dist, 0, dest);PrintGraph_OneNode(dest, M, 0);/// <summary>/// Floyd最短路径算法,求指定节点到其它节点距离/// </summary>/// <param name="dist">邻接矩阵</param>/// <param name="index">指定节点在邻接矩阵下标</param>/// <param name="D">最短路径</param>public static void Floyd_OneNode(int[,] dist, int index, int[,] D){//复制一份distfor (int i = 0; i < M; i++){for (int j = 0; j < M; j++){D[i, j] = dist[i, j];}}for (int k = 0; k < M; k++){//i为指定节点int i = index;for (int j = 0; j < M; j++){D[i, j] = Math.Min(D[i, j], (D[i, k] == 0 || D[k, j] ==0) ? 0 : D[i, k] + D[k, j]);}}}

如果，您认为阅读这篇博客让您有些收获，不妨点击一下右下角的【推荐】按钮。
如果，您希望更容易地发现我的新博客，不妨点击一下绿色通道的【关注我】。

因为，我的写作热情也离不开您的肯定支持。

感谢您的阅读，如果您对我的博客所讲述的内容有兴趣，请继续关注我的后续博客，我是焰尾迭 。