javaweb 酒店管理系统

这是一个用开发的的多线程类只要加入工程可以非常方便的使用-This is a development of the use of multithreading to the project as long as the class is very convenient to use

Delphi资源文件生成工具 我经常要在程序中加入许多资源，比如：声音、位图、光标等，这样可以使自己 软件更具特色。可以自己建立一个.RC的文件，然后再用DelphiBinBrcc32.EXE来 编译生成一个.RES的文件，有了这个文件才能把资源编译到软件中去。 可是如果要加入一大批资源，要加入30个位图和20个光标的话，就要在.RC文件中一 行行加入要用的资源，比较麻烦。我是个懒人，所以自已写了这个能自动批量帮你完 成这个任务的工具，可以非常方便的生成.RES资源文件。 注意：由于Borland的Brcc32.EXE不能识别包含有空格和汉字的路径，所以你的资源来 源路径和保存路径不要带有空格和汉字，否则不能建立.RES的文件。-Delphi resources to generate tool I often join in the proceedings of many resources, for example : voice, bitmaps, cursors, etc., can make more software features. One can establish their own. RC paper, and then spend the Delphi bin Brcc32.EXE to build a generation. RES document, the document can have the resources to build software. But if a large number of resources to join, to join the 30-bit map and the cursor 20, then we should. RC paper lines to join with the resources, and trouble. I was lazy, so own writing this volume will automatically help you complete this task tool, it is easy generation. RES resource files. Note : Due to Borland"s Brcc32.EXE not include

3D波动网格，不使用DirectX，在窗口中画显示波动的3D网格效果，具有较高的学习价值-Fluctuations in 3D meshes, do not use DirectX, painting in the window display fluctuations 3D grid effect, have a high learning value

利用VC++开发的基于mfc CSocket的网络通信服务器和客户端，给初学者以借鉴。-Using VC++ developers mfc CSocket-based network communications server and the client, giving beginners to learn.

Visual Basic 的算法演示，用鼠标旋转立方体-Visual Basic algorithm demonstration rotating cube with the mouse

Ez-usb 通讯PC端程序，利用DeviceIOControl轻松实现USB通讯，另外还带有适时显示获取数据部分，可以把数据动态显示成曲线，VC6编译通过，值得初学者学习借鉴。

网卡RTL1819 驱动源码，希望大家受益。

cms内容管理系统,项目结构分为目录管理，文章管理，评论管理，用户管理，招聘管理，系统管理，功能基本实现，使用数据库mysql5.5以上版本,开发工具Myeclispe,用maven构建的工程

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.

打开IE 浏览器，调用 m_pWebBrowser2 类实现-Open the IE browser, called m_pWebBrowser2 class to achieve