weixin_44006014的博客

BFS—宽度优先搜索 用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。 基本信息 中文名称 最短路径 外文名称 shortest path 性质 一类经典算法问题 解决思路 由已知点/边向外扩展 ...

Prime Path The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices.  — It is a ...