搜索资源列表
span_forest
- Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, \"g++ -o span_forest span_forest.c\". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper t
mergeinS
- merge sort give a set S of n integers and another integer x, determine whether or not there exits two elements in S whose sum is exactly x.-merge sort give a set of S n integers and anot her integer x, determine whether or not there exits two elemen
02666199TS-TSP
- 禁忌搜索算法，解决三十个城市间的旅行商问题，求最短距离-Tabu search algorithm to solve thirty cities between the traveling salesman problem, the shortest distance
wielomian
- This a program that is bein able to calculate linear equations of advanced levels. I ts in the form of class with methods and has implemented operators that allowes user to calculate things by basic types like +/-/*.-This is a program that is bein ab
ts
- 图书管理系统，c++数据结构,课程设计，文件操作-Library management system, c++ data structures, curriculum design, file operations
ts
- 线性表的基本操作建立一个包含图书（书号，书名，定价）信息的的链表，并具有如下功能： (1) 根据指定图书个数，逐个输入图书信息； (2) 根据书名进行查找，返回此书的书号和定价； -Linear form of the basic operation to establish a book (ISBN, title, pricing) information linked list, and has the following functions: (1) according to
ts-solve-0-1-knapsack-a-info
- 用禁忌搜索解决0-1背包问题，及一些关于禁忌搜索优化和并行处理的资料-Tabu search to solve 0-1 knapsack problem, and some information on tabu search optimization and parallel processing of data