xiaodong8812的博客

QuickSort算法的实现 最小生成树算法 多段图算法 N皇后问题算法设计 货郎担问题求最优解

Modify Dijkstra’s algorithm, so that it finds the hop lengths of the shortest paths from a given node s to all other nodes in a given undirected connected graph G. Note that ： • find the shortest paths. and need to find the hop lengths of the shortest paths. • The hop length of a path is defined as the total number of hops for the path

Design a linear time algorithm for each of the following problem: (1) given a graph G, test if G is connected. (2) given a graph G, test if G is a tree. (3) given a graph G, test if G has a cycle,if so,print a cycle

这是a BFS-based shortest path program。其中包含算法和程序源代码，完整的实验报告模板。