先输入图的各顶点名，再输入图的邻接矩阵从而建立图，并用笛施卡尔，普里姆等三种方法求其最小生成树，-input vertices of the plan, and plans to import the adjacency matrix thereby establishing map, and use flute Shi Carl prim other three methods for the minimum spanning tree,

VB控制单片机数据传输，控件使用方法,串口通信-vb bus shi taidong zm xie

本例程是基于VC++设计，能实现链表直接的互相操作；能直接控制链表的读写操作-This routine is based on VC++ design can achieve the linked list directly interoperable able to directly control the linked list of read and write operations

朴素模式匹配，最容易看懂的算法，不过效率不太高-Simple pattern matching, the easiest way to understand the algorithm, but efficiency is not high