登录
首页 » Visual C++ » Simulation-of-dendritic-growth

Simulation-of-dendritic-growth

于 2012-04-06 发布 文件大小:6581KB
0 256
下载积分: 1 下载次数: 60

代码说明:

  模拟枝晶生长,在统计学常用的一种算法,对随机理论有帮助。(Simulation of dendritic growth, the statistics used an algorithm, the stochastic theory.)

文件列表:

模拟枝晶生长
............\对流作用下纯物质枝晶生长的相场法模拟.pdf,625368,2012-02-28
............\最新程序.doc,51712,2012-02-28
............\相场法模拟对流对枝晶生长的影响.nh,6806551,2012-02-28
............\要求.doc,94208,2012-02-28

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

发表评论

0 个回复

  • C-data
    大一c语言实验的所有源码以及实验报告报告(All source code and report experimental freshman c language)
    2016-12-23 23:43:39下载
    积分:1
  • 算法集锦
    数据结构算法集锦:包括大量常用算法,如求两数的最大公约数、素数的求法、Prim算法、Kruskal算法、最短路径、Dijkstra 算法、排序相关算法、高精度计算相关算法(algorithm data structure highlights include : large common algorithms, such as for the number two majors, for the prime numbers, Prim algorithm, Kruskal algorithm, the shortest path, the Dijkstra algorithm, scheduling algorithms, high-precision calculation algorithms, etc.)
    2005-06-28 19:55:07下载
    积分:1
  • arrangement
    假设要在足够多的会场里安排一批活动,并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点,不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数,相应于要找的最小会场数。) 对于给定的k 个待安排的活动,编程计算使用最少会场的时间表。 (Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.) K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)
    2014-10-22 11:00:45下载
    积分:1
  • Cpp2
    c-w算法,讲述一种分配运输的节约方法,适合于车辆的调度(c-w algorithm,About one distribution transport saving method, suitable for vehicle scheduling)
    2011-12-07 15:02:14下载
    积分:1
  • 123
    校园导航系统 1) 校园景点介:绍介相关景点的有关详细信息。 2) 最佳路线查询:查询校园中任意两点之间所有路线,并提供两点间最短的简单路径。 3) 关节点查询:提供校园图的关节点查询。 4) 多景点最佳路线查询:提供多个景点的最佳线路查询,即求途径这个景点的最佳路径。 (Campus Navigation System 1) campus attractions Introduction: Shao Jie-related attractions for more information. 2) The best route query: Query on campus all the routes between any two points, and provides a simple shortest path between two points. 3) joint points: the key points to provide the campus map queries. 4) The best route queries more attractions: multiple sites to provide the best route queries, that is seeking ways to this spot the best path.)
    2011-08-25 08:56:05下载
    积分:1
  • 04huffman_a
    根据最常用的链表法进行huffman编码,可以手工预制权重,例如n=8的时候即可以在文件中写入,输出相应的编码结果(According to the most commonly used method of Chain Huffman coding, manual can be prefabricated weight, For example, n = 8 when it is written in the document, the output corresponding to the coding results)
    2007-05-29 19:15:26下载
    积分:1
  • C-integer-linear-sequence
    对元素类型为整型的顺序存储的线性表进行插入、删除和查找操作(C++)。(C integer linear sequence of stored data table insert, delete and search operations)
    2011-11-20 11:13:40下载
    积分:1
  • PrintTheSchedule_DataStructure_Lab4
    数据结构试验-打印输出计算机本科专业4年每学期的课表;C++实现;图的邻接表存储结构以及拓扑排序的基本思想(Data structure test- printout computer 4 years of undergraduate per semester timetables C++ achieve basic idea of ​ ​ the adjacency table storage structure and topological sorting)
    2012-11-24 23:30:41下载
    积分:1
  • C++
    说明:  标准答案习题1 1.1 简述C++语言程序的结构特点。 答: (1)C++程序由一个或多个函数组成,其中至少有一个主函数main(),程序从主函数开始执行,由主函数来调用其他函数。(Standard answer to Exercise 11.1 on C++ Language program structural characteristics. Answer: (1) C++ Procedures by one or more functions, of which at least one of the main function main (), the procedure started from the main function, from the main function to call the other function.)
    2008-11-25 16:16:27下载
    积分:1
  • lvxingshang
    一个经典的旅行商问题源码,不是最优解,只是一种 思路(A classic traveling salesman problem source is not the optimal solution, just a thought)
    2012-11-09 01:33:02下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载