Dijkstra算法（带路径记录）

计算起点到各个节点的最短路径，并记录路径节点

根据图得到邻接矩阵（下图的邻接表）

unity里面挂到物体运行即可看到结果 

using System.Collections;
using System.Collections.Generic;
using System.Text;
using UnityEngine;

public class Dijkstra : MonoBehaviour
{
    int inf = 999999;
    List<List<int>> adjacentMatrix;
    List<int> dis = new List<int>(); //起始点1距离其他节点的距离
    List<int> book = new List<int>(); //记录遍历过的节点
    int VertexCount = 6; //节点个数
    int[] recoderPath = new int[6] { 0,0,0,0,0,0};  //记录路径节点
    void Start()
    {
        InitMatrix();
        dijkstra();
        StringBuilder str = new StringBuilder();
        StringBuilder str2 = new StringBuilder();
        for (int i = 0; i < dis.Count; i++)
        {
            str.Append(dis[i].ToString()).Append(",")