1迪杰斯特拉算法(单源有权最短路径) tip:广度优先是单源无权最短路径 https://www.bilibili.com/video/BV1zz4y1m7Nq 2最小生成树 (1)kruskal+prim https://www.bilibili.com/video/BV1Eb41177d1?from=search&seid=6184746878799604675 3KMP https://www.bilibili.com/video/BV1Qb411h7U6