资源列表
shortpath
- 利用临界矩阵求解又向图的最短路径，并输出权值和最短路-The use of critical matrix also plans to solve the shortest path, and the right output value and the most short-circuit
HuffmanTree
- 文件包含HuaffmanTree.cpp，与头文件HuaffmanTree.h和MinHeap.h 编译后可生成哈弗曼树,是学习数据结构的很重要的基础-the file includes HuaffmanTree.cpp and HuaffmanTree.h and MinHeap.h
calendar
- 提供了c语言中一般有关日期的函数，比如判断某年某天星期几等，某年是否为闰年等-calendar.zip provides some functions for the operates on date.for example,judeging whether a year is a leap year.
-FIRstVTandlast5
- 算符优先算法，主要是通过堆栈来实现的先压栈后出栈的形式来实现的-The operator precedence algorithm is first pushed on the stack after stack to form a stack
Car1
- 流水车间调度问题，应该可以说是，最好的方法-flow shop
dateclassOO
- 这个程序是一个日期(包括年月日)类的具体实现有各种功能下载后即可研究,它包括了C++面向对象的几乎所有内容,对初学面向对象的学生十分有帮助.-the procedure is a date (including the date) class is a concrete realization of the various functions can be downloaded, It includes the object-oriented C in almost all the elemen
C-language-graphic-
- C语言图形的实现与操作，运用最小生成树算法，实现图形的操作-C Language Implementation and Operation of graphics, the use of minimum spanning tree algorithm, the operation of graphics
Ex1
- public: List() //构造函数 int size() const //返回链表的长度 bool full() const //返回链表是否已满 bool empty() const //返回链表是否已空 void clear() //清空链表 int retrieve( int position, string &x ) const //获取链表第position位置的元素到x，成功返回0，否则返回-1 int replace( int positi
completo
- Linear Linked List Data Struct in C/C-Linear Linked List Data Struct in C/C++
FullArray
- 本代码可以将一个整数数组进行全排列，并将排列结果放到一个大数组里面，这样我们就可以轻松解决手动全排列的繁琐工作了-This code can be arranged in an array of integers for all, and the results are arranged into a large array inside, so we can easily solve the full array of tedious manual work
k-means
- k-均值聚类算法（C语言实现）： 给定类的个数K，将N个对象分到K个类中去，使得类内对象之间的相似性最大，而类之间的相似性最小。-k-means clustering algorithm (C language): given the number of classes K, N objects will be assigned to the K class, making the class the biggest similarity between objects, and the s
getd
- 最优化设计程序之一.共轭剃度法.给出步长和初值.-optimal design procedures one. Conjugate tonsure law. And given initial step.