BDijkstra算法的java实现。使用工具是eclipse，java1.4以上

这是一个TSP问题的限界算法，用C++编程的

实现卡洛图的自动化简功能，最大字符为4个，即对于一个4 x4的数，将其中可以合并的1化简，得出最简和最优的结果，与手工化简结果一致-Calo plans to achieve automation SR function, the largest of the four characters, that is for a 4 x4 few, which will be an amalgamation of a simplification, reduction and produce the most optimal results, and manual results are consistent Simplification

MaxtoCode StandardMaxtoCode StandardMaxtoCode StandardMaxtoMaxtoCode StandardMaxtoCode StandardCode StandardMaxtoCode StandardvvvvvvMaxtoCode StandardMaxtoCode StandardMaxtoCode StandardMaxtoCode StandardMaxtoCode StandardMaxtoCode Standard

描述 问题描述： 给定一个只包含数字[0..9]的字符串，求使用字符串中的某些字符，构建一个能够整除15的最大的整数。 注意，字符串中的每个字符只能使用一次。 编程任务： 求由给定字符串构建的能够整除15的最大整数。-Description of the problem description: Given a contain only numbers [0 .. 9] of the string, seeking to use some of the characters in the string, one can build the largest integer divisible by 15. Note that the string for each character can only be used once. Programming task: seeking from the given string that can build the largest integer divisible by 15.

jobscope jobscope 在线求职人 1） PHP 2） mysql 数据库 3）类

一个招聘管理系统-a recruitment management system

图论算法，旅行推销员问题，很有趣。 可算出图中的哈米尔顿回路-graph algorithm, traveling salesman problem, very interesting. Map can be calculated totally dominated the circuit

用c实现的判断一个图是否有环，数据结构中的经典算法，输入一个图，然后判断是否有环。-used to achieve a judgment whether there are plans in Central and data structure of classical algorithm, the importation of a map, and then determine whether there is any ring.

很好的系统,vc++ + ASSSE 系统-good system, vc ASSSE system

数据结构哈夫曼实习报告-data structure Huffman internship report