- 博客(0)
- 资源 (4)
空空如也
QuickSort算法的实现;最小生成树;多段图,n皇后,货郎担问题的算法及源代码
QuickSort算法的实现
最小生成树算法
多段图算法
N皇后问题算法设计
货郎担问题求最优解
2008-12-27
算法——Dijkstra’s algorithm求最短路径并打印出路径的各个节点
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
2008-12-27
算法—判断一个图是否是连接的;是否是树;是否有环,有环的话打印出来
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
2008-12-27
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人