登录
首页 » Delphi » TravellingSalesman

TravellingSalesman

于 2008-12-29 发布 文件大小:175KB
0 195
下载积分: 1 下载次数: 14

代码说明:

  旅行商算法,实现从加权有向图中寻找并输出最短的闭合路径(Traveling salesman algorithm, from a weighted directed graph to find and output the shortest path closure)

文件列表:

旅行商动态规划 生医 唐南 5050809393
......................................\TravelingSalesman.dcu
......................................\TravelingSalesman.ddp
......................................\TravelingSalesman.dfm
......................................\TravelingSalesman.pas
......................................\TravelingSalesman.~ddp
......................................\TravelingSalesman.~dfm
......................................\TravelingSalesman.~pas
......................................\TSP.cfg
......................................\TSP.dof
......................................\TSP.dpr
......................................\TSP.exe
......................................\TSP.res

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

发表评论

0 个回复

  • 12
    说明:  下面是一个结构体声明: struct box { char maker[40] float height float width float length float volume } a. 编写一个函数,按值传递box结构,并显示每个成员的值 b. 编写一个函数,传递box结构的地址,并将volume成员设置为其他三维长度的成绩。 c. 编写一个使用这两个函数的简单程序 (Here is a structure declaration: struct box {char maker [40] float height float width float length float volume } a. Write a function that is passed by value box structure, and shows the value of each member b . to write a function, passing the address box structure and volume settings for the other three members of the length of the results. c. use these functions to write a simple program)
    2013-06-02 17:27:08下载
    积分:1
  • youxiangtu
    编写C程序,随机给出n*n的邻接矩阵,并打印输出邻接矩阵,以及有向图的边的个数,每个顶点的度,并判断该图中是否存在Euler回路: (1)如果为n阶,则随机产生一个n*n的邻接矩阵; (2)输出邻接矩阵,边的个数,每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点,一个是数据结构中的有向图的邻接矩阵的创建,还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)
    2008-06-14 02:33:57下载
    积分:1
  • tiebou-V3.0
    最大信噪比的独立分量分析算法,能量熵的计算,混沌的判断指标Lyapunov指数计算。( SNR largest independent component analysis algorithm, Energy entropy calculation, Chaos indicator for Lyapunov index calculation.)
    2017-04-23 12:22:09下载
    积分:1
  • A
    说明:  对简单的一些计算用计算器计算出来,包括加减乘除(Some of the simple calculated calculation calculator, including the Math)
    2010-06-12 12:14:17下载
    积分:1
  • NDVI
    多种方法实现栅格数据计算NDVI,包括逐个像素处理、栅格计算器计算。(A variety of methods to calculate raster NDVI, including by-pixel processing, raster calculator.)
    2020-12-29 10:29:01下载
    积分:1
  • ConvertTool
    说明:  GBK,unicode utf-8 编码转换工具(Encode Convert Tool between GBK,unicode utf-8,url)
    2020-06-22 23:40:01下载
    积分:1
  • analla
    模拟串口程序 占用T0 或者T2 波特率9600 起始位 1位(Analog serial port program uses T0 or T2 baud rate 9600 start bit 1 bit)
    2019-03-25 12:04:29下载
    积分:1
  • Cpp1
    后缀表达式计算器,这里是整个CPP,文件里代码完整,适合初学者阅读使用。(Postfix expression calculator, here is the entire CPP, file integrity code, suitable for beginners to read.)
    2015-04-17 14:48:58下载
    积分:1
  • calculator
    Calculator using switch
    2012-05-09 01:40:26下载
    积分:1
  • 1234
    简单计算器的界面代码,以及实现相关功能,加减乘除清零等(Simple calculator interface code, as well as the relevant functions)
    2013-09-08 17:14:46下载
    积分:1
  • 696518资源总数
  • 106010会员总数
  • 4今日下载