qq_21832235的博客

计算起点到各个节点的最短路径，并记录路径节点根据图得到邻接矩阵（下图的邻接表）unity里面挂到物体运行即可看到结果using System.Collections;using System.Collections.Generic;using System.Text;using UnityEngine;public class Dijkstra : MonoBehaviour{ int inf = 999999; List<List<int>.

由于要做地图间的寻路，学习了下这个算法记录下floyd 带路径算法（回路负权不适用）在unity直接挂物体上运行即可using System.Collections;using System.Collections.Generic;using UnityEngine;public class Floyd : MonoBehaviour{ List<List<int>> adjacentMatrix; List<List<int&gt