资源列表
C_The-critical-path
- 用C写的，求顶点事件的最早发生时间和顶点最晚发生时间 -Written in C, find the earliest time events vertex and vertex latest time occurred
C_A-topological-sort
- 用C写的，输入一张图的顶点和入度，得出顶点的拓扑排序-Written in C, the degree of input into the vertex and a graph, draw the vertices of topological sorting
Source1
- change hb matrix to csc matrix
MatrixChain
- 实验二-矩阵链乘 Descr iption 给定n个矩阵A1，A2，…，An，其中，Ai与Aj+1是可乘的，i=1，2，…，n-1。 你的任务是要确定矩阵连乘的运算次序，使计算这n个矩阵的连乘积A1A2…An时总的元素乘法次数达到最少。 例如：3个矩阵A1，A2，A3，阶分别为10×100、100×5、5×50，计算连乘积A1A2A3时按（A1A2）A3所需的元素乘法次数达到最少，为7500次。-MatrixChain dp
Observer
- a observer pattern desing example in c++ a basic class room one
dbscan_homework
- dbscan算法，数据挖掘期末作业。用matlab编写。自己是一份报告。内含全部代码。测试可以使用。-dbscan algorithms, data mining final assignment. Written in matlab. It is a report. Contains all the code. Test can be used.
4.17
- 编写一个递归算法实现： T(n)=T[n/2](向上取整)+T[n/2](向下取整)+n T(1)=1 然后用栈来模拟递归调用，重新编写一个算法. -Write a recursive algorithm implementation: T (n) = T (rounded up) [n/2]+ T n/2+ n (round down) T (1) = 1 Then use the stack to simulate the recursive call to w
4.6
- 用C++实现的。给线性表添加一个成员函数，倒置线性表中元素的顺序。对于n个元素的线性表，算法的时间代价为n.-With c++ implementation. Linear table to add a member function, the order of the elements in a linear inversion table. For the linear table of n elements, the algorithm of time cost for n.
mergesort
- 用C++实现在数据的输入，并通过输入要查找的数据的值返回所查找的数据所在数组中的位置-In c++ to realize the data input, and through the input data to find the value of the return to find the position of the array of data
MinMaxHeap
- 最小最大堆的插入，删除，找最大最小值操作实现（写成C++库文件的形式，可在.cpp代码中直接调用）-MinMaxHeap, we can implement findMin and findMax in O(1) time and insert or delete in O(log n) time.
Huffmancode
- 依据字符出现概率来构造异字头的平均长度最短的码字-On the basis of the average length of characters appear different prefix probability to construct the shortest codeword
expression_calcuate
- 输入一个表达式，可以求出表达式的值（表达式中可以带括号，进行加减乘除运算）-Enter an expression, you can calculate the value of the expression (expression in parentheses, are add, subtract, multiply and divide operations）