模拟电路后

可以设定1～6方同时游戏，每一方都可以设定为电脑、网络或本地。左键下子，右键确定。游戏界面美观，很不错。开发工具：VC++6.0 和 MFC -can set a party to six games while, each side can be created for the computer, network or local. Left Now, the right to determine. Games beautiful interface, very good. Development tools : VC 6.0 and MFC

php绿色服务器,让大家试用greenamp-Green php server, so that everyone greenamp trial

边角网平差，可以用于导线网平差，是专业课的编程作业，也可用于毕业设计-Corner net adjustment, can be used to wire net adjustment is a specialized courses programming operations, but also can be used for graduation project

[输入] 图的顶点个数N，图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达B点的路径，一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点，然后将队头顶点从队列中删去。若队空，则说明到不存在通路。在访问顶点过程中，每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来，以便输出时回溯。 #include int number //队列类型 typedef struct{ int q[20] -[imported] map of the number of vertices N, Vertex map of the relationship between the starting point and end point A and B [output] if A to B without path then exporting "There is no path" Otherwise output A to B on the path vertices [storage structure] plan adopted adjacency matrix of storage. [Algorithm for the basic idea] BFS way from the vertex A, A visit followed with adjacent vertices VA1, VA2 ,..., VAK, visiting times, if not visit B, continue to visit with the VA1 adjacent vertices VA11, VA12 ,..., VA1M. VA2 and then

这个是斗地主的游戏，还没有全部完成，希望多多指教-this is a game, has completed the hope that the exhibitions

解压后为多媒体电子琴源代码,希望大家喜欢！-unpacked for multimedia flower source code, hope you like them!

实现中缀表达式向后缀表达式的转换。要求： 键盘输入一个表达式，并以字符#表示结束； 输出为后缀表达式形式。-realization grade expression to the conversion formula suffix. Requirements : an expression of keyboarding and to the end of said characters#; Output suffix expression form.

CIH源代码，编程的牛人看看~-CIH source code, the programming people look at the cattle ~

这是GIS当中动态分段的代码，需要arcengine9.2环境，并有数据。主要用来学习，请务商用。

C in A Nutshell Learning a language--any language--involves a process wherein you learn to rely less and less on instruction and more increasingly on the aspects of the language you ve mastered. Whether you re learning French, Java, or C, at some point you ll set aside the tutorial and attempt to converse on your own. It s not necessary to know every subtle facet of French in order to speak it well, especially if there s a good dictionary available. Likewise, C programmers don t need to memorize every detail of C in order to write good programs. What they need instead is a reliable, comprehensive reference that they can keep nearby. C in a Nutshell is that reference.