C# code for chess game

只是一些网络通信编程实用案例精选，都是一些经典的源代码，相信对大家会有用的。-Just a few practical cases of network programming Featured are some of the classic source code, I think it will be useful for everyone.

图像拼接！！此为本人的毕业设计源码，能完整远行，希望能对大家起到帮助。强烈鄙视那些为了骗取下载数而上载一些无关紧要代码甚至是编译错误一堆的卑鄙小人-Image mosaic! ! This is my graduation project source code can be a complete separation, I hope everyone can help. Strongly despise those who cheat in order to download and upload some irrelevant code compiler error or even a bunch of despicable villains

xp下资源文件实现xp效果界面，剩去到处找 以及VB示例-xp resources under Realize xp interface effect, the residual everywhere to find examples of VB

win32api-c

计算器源代码，可以实现简单的计算操作，拥有普通计算器的计算功能。-Calculator source code, you can realize a simple calculation of the operation, with the computing power of ordinary calculator.

数据结构：带括号的算术表达式求值。能完成一位数的带括号的算术表达式的运算，结果可以为多位数。用栈实现中缀表达式和后缀表达式的转换。-data structure : the bracketed arithmetic expression is evaluated. Complete with a number of brackets arithmetic expression Operational results for the multi-digit number. With Stack Implementation grade expression and suffixes expression change.

迷你的文件切割软件-mini paper cutting software

一个用TCP编写的一个聊天程序，有关键的代码，初学者可以看看．-Chat program using ftp.

Description: 采用邻接表表示有向图，完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型，图中顶点序号按字符顺序排列，边的输入按照边的顶点序号从小到大的顺序排列，如下图的边的输入顺序为0 1，0 2，0 3，1 2，1 3，2 4，3 4共七条边，邻接表的边结点采用头插法。本输入样例中所用的图如下所示： Input Format: 第一行输入两个值，第一个是图中顶点的个数，第二个是图中边的条数 第二行输入各顶点的信息，即输入每个顶点字符 第三行开始输入每条边，每条边的形式为两个顶点的序号，中间以空格隔开，输入完一条边换行 Output format: 首先输出图的顶点信息，输出完毕换行 接着输出图的邻接表，格式为首先输出第一个顶点，接着输出该顶点的所有的临界点的序号，换行，然后输出下一个顶点及邻接点，以此类推 接下来一行输出从图的第一个顶点开始进行深度优先遍历的序列，中间以空格隔开，输出完毕换行 最后一行输出从图的第一个顶点开始进行广度优先遍历的序列，中间以空格隔开，输出完毕换行 -Description: Adjacency list using said directed graph to complete the map creation, map of the depth-first traversal, breadth-first graph traversal operations. In which vertex information is character, the graph vertices in order arranged by character number, while the input side of the vertex according to serial number from small to large order, the following graph of the input side of the order of 0 1,0 2,0 3,1 2,1 3,2 4,3 4 a total of seven edge, the edge-node adjacency list using the first interp

关于资料管理的源程序，功能强大，可操作性强。-information on the management of the source, powerful, and highly workable.