搜索资源列表
50402417
- 和树类似，图的遍历是图的一种主要操作，可以通过遍历判别图中任意两个顶点之间是否存在路径、判别给定的图是否是连通图并可求得非连通图的各个连通分量，但对于带权图（网），其最小生成树或最短路径都取决于弧或边上的权值，则需要有特定的算法求解。-and similar trees, graph traversal map is a major operation, Discrimination can traverse map between any two vertices existence trai
sanjiaoxing
- 求三角形面积的算法，可以将输入的三个符合三角形定理的字符转化为整数来求面积-Triangle area of the algorithm, can be imported with three triangle theorem of the characters into the area to seek Integer
travel
- 旅游路径检索，运用一点数据结构中的最短路径求最优解的算法，进行调用-Travel the path search, the use of the data structure that seek optimal solutions of the shortest path algorithm, a call
cipandiaodusuanfa
- 磁盘调度算法实现1、先来先服务（FCFS） 2、最短寻道时间优先（SSTF） 3、扫描算法（SCAN） 4、循环扫描算法（CSCAN） -1 disk scheduling algorithm, first come first served (FCFS) 2, the shortest seek time first (SSTF) 3, scan algorithm (SCAN) 4, cyclic scan algorithm (CSCAN)
GCD
- 求最大公约数和最小公倍数的算法，输入任意里两个整数，输出他们的最大公约数和最小公倍数。-Seek the greatest common divisor and least common multiple of the algorithm, enter any two integers, and output their greatest common divisor and least common multiple.
SStF
- 最短寻道时间优先（SSTF）和扫描（SCAN）算法-Shortest seek first (SSTF) and scanning (SCAN) algorithm
sd
- TFIDF算法，先求TF，然后求出IDF，最后根据公式得出TFIDF-TFIDF algorithm, first seek TF, and then find the IDF, TFIDF conclusion that according to the formula