php蓝狐文章管理系统

用于矩阵地相乘，矩阵的转置以及逆矩阵的求法-For matrix multiplication, transpose and inverse matrix method of seeking

此程序用来学习C++的好实例，从简单入手，循序渐进，希望大家有所收获。-This procedure is used to learn C++, good examples, from simple start, step by step I hope you gain something.

韦根感应IC卡读写器原理图,成熟产品,已经用于销售,单片机采用STC89C58RD+,读写模块为RC5-Wiegand sensor IC card reader schematic, mature product, has been used for sales, single-chip microcomputer used STC89C58RD+, Read and write modules for RC5

一个计算24的益智类游戏-a calculation of 24 educational games

频繁模式挖掘算法，可以用于数据挖掘中关联规则的频繁项集挖掘- The frequent pattern excavation algorithm, may use in the data mining to be connected the rule the frequent item of collection to excavate

D3D Tile demo,很好的Tile演示-D3D Tile demo, very good presentation Tile

TI DSP 的FVID函数的说明，使用dm642的人员可以参考学习。-TI DSP s FVID function shows that the use of DM642 personnel can refer to learning.

界面友好，简洁、头像丰富! 稳定快速! 模块良好! 支持悄悄话! 很适合于初学 ASP 的人分析学习! 管理用户名：admin 密码：admin-friendly interface, simple, rich portrait! Rapid! Module good! Support brother! Very suitable for beginners ASP analysis of learning! Management Username : admin Password : admin

这是几个游泳的测试程序，都是些基础的东西，有带学习 -This is a swim test procedure are some basic things, the learning

[输入] 图的顶点个数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