vc与matlab7的混编，采用的混编方式是通过shared

sign sis for s60 symbian

一个查找函数的源代码 -a search function in the source code

这是数学建模中图论中的几个重要的模型求解。包括最短路径的两种方法，以及加权的求法-This is the mathematical modeling of graph theory of a number of important model solution. Shortest Path, including the two methods, and the weighted Solution

关于c语言的一些文章，对于新手老手都有参考价值，我是受益匪浅啊-language on the article, veteran newcomers have reference value, I benefited ah

K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的 边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选 取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步，其中e 是网络中 边的数目。按耗费递增的顺序来考虑这e 条边，每次考虑一条边。当考虑某条边时，若将其 加入到已选边的集合中会出现环路，则将其抛弃，否则，将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.

System will automatically delete the directory of debug and release, so please do not put fi

哥德巴赫猜想,哈夫曼编码译码器,河内塔问题等的VC++解决，许多算法的实现-Goldbach Conjecture, Huffman decoder, Hanoi tower problem, etc. VC++ Resolved, the realization of many algorithms

简易进销存（学习用） 绝对私人开发，并非上网抄袭-summary Invoicing (to study) absolutely private development, the Internet is not plagiarism

钢琴弹奏程序源代码.zip-Piano Playing source code. Zip

u盘自动拷贝，很方便的实现您的工作。请您使用-u disk automatically copy, it is convenient for the realization of your work. Please use