雏菊
迪杰斯特拉算法是由荷兰计算机科学家狄克斯特拉于1959 年提出的,因此又叫狄克斯特拉算法。是从一个顶点到其余各顶点的最短路径算法,解决的是有向图中最短路径问题。迪杰斯特拉算法主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。Dijkstra algorithm is made by Holland computer scientist Dijkstra in 1959, so it is called Stella Dick algorithm. The shortest path algorithm from one vertex to the rest of the vertices is the shortest path problem in the directed graph.. Dijkstra algorithm is characterized by the starting point as the center of the expansion of the center, until the end of the extension.