登录
首页 » Visual C++ » lvxingshang

lvxingshang

于 2012-11-09 发布 文件大小:440KB
0 198
下载积分: 1 下载次数: 4

代码说明:

  一个经典的旅行商问题源码,不是最优解,只是一种 思路(A classic traveling salesman problem source is not the optimal solution, just a thought)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • jgctgu
    流水线车间的零件加工排序问题,以达到最优的加工顺序,使加工时间最短或零件后期维护费用最少(Plant parts processing pipeline scheduling problem, in order to achieve optimal machining sequence, so that the processing time of the shortest or least parts later maintenance costs)
    2014-05-08 01:12:54下载
    积分:1
  • xianxingbiaolianjie
    线性表的链接实现可利用单链表来实现,每个节点存储一个元素。 利用单链表来实现线性表的元素的插入,删除,修改等功能。 (Linear link table can be used to achieve a single linked list to implement, each node stores an element. Using a single linked list to implement elements of the linear table insert, delete, modify, and other functions.)
    2011-04-26 11:57:25下载
    积分:1
  • 最小生成树
    给定一个带权的无向连通图,如何选取一棵生成树,使树上所有边上权的总和为最小(Given a weighted undirected connected graph, how to select a spanning tree to minimize the sum of all the upper bounds on the tree)
    2017-06-05 17:27:17下载
    积分:1
  • chain
    链表的模板类,提供插入删除,遍历器,查找等功能,只有一个头文件,可以包含到你的工程(template implemention of Chain)
    2013-12-09 11:04:33下载
    积分:1
  • huffman
    数据结构(严蔚敏版)中哈夫曼树的操作程序源代码(Of data structure (Yan Wei Min version) operating procedures in the source code Huffman tree)
    2010-05-24 23:19:39下载
    积分:1
  • heapsort
    说明:  从最后一个非叶子结点开始从后往前进行调整,保证了根下的所有子树都是最大堆,最后对根进行调整,使整棵二叉树为最大堆,保证了根结点为整棵数的最大值点,完成了建堆的过程,再将根结点跟最后一个结点进行交换,如此反复操作,则堆排序就完成了,其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)
    2008-11-11 22:53:42下载
    积分:1
  • Online_RandMarkingAlgorithm
    本程序解决的是:模拟类似计算机主、缓存的存储结构,当用户请求某个页面时,若某个页面已在缓存中,则直接从缓存中去取,不会产生失误(即未在缓存中命中),否则,就到主存中去取,代价变大。 本程序采用随机标记算法,即在在线标记算法的基础上,对于替换页面时,采用随机从未标记的缓存项中选出一项进行替换。 代码、文档详尽(Addressed in this program are: analog computer-like main, cache storage structure, when the user requests a page, a page in the cache directly from the cache to fetch, does not produce errors (that is, not in the cache in the hit), otherwise, to the main memory to fetch a consideration of larger. This program uses a random marking algorithm, online marking algorithm based on random never mark the cache entry selected a replacement for the replacement page. Code, documentation detailed)
    2012-09-19 13:01:47下载
    积分:1
  • DataStructAndAlgorithm
    数据结构与算法综合资料库,是一本很好的学习计算机的基础教程(Data Structures and Algorithms General database, are a very good tutorial to learn basic computer)
    2009-03-14 17:56:03下载
    积分:1
  • test
    矩阵运算器,c语言编程,数据结构,免费下载(Matrix calculator, c language programming, data structures, free download)
    2008-05-04 09:32:59下载
    积分:1
  • graph-DFS
    邻接表存储图,然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)
    2013-10-27 20:16:41下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载