C#的一些源程序，希望这些对大家能够有一些帮助。

一、K-Graph oddity problem    此程序利用图的广度优先遍历算法，通过遍历各个顶点并为其涂色从而实现题目要求。 二、迷宫问题     此程序为在60s内完成迷宫游戏，由数组矩阵构成迷宫图形.

http工具可以方便快捷的使用和才做c#对web请求的帮助工具

完成不带PML边界的2维声波介质波场正演(Forward modelling of the wave field in two-dimensional acoustic medium)

激光切割上位机源码，生成NC刀路，不含NC扩展插件。(Laser cutting the host computer source code, generate NC knife road)

自己编写的Access数据库 库存查询系统 编译器vs2005.MFC类库。 查询功能分解详细，大部分索引使用下拉菜单设计，自动搜索数据库添加相应内容，方便查询，免去按键手动添加...,数据添加方便，适用于Excel整体导入，方便维护。 库存查询-按enter自动查询所有库存及按索引查询 出库跟踪-按enter自动查询所有借用信息及按索引查询 借还操作-借用及归还操作 数据库维护-添加删除修改及excel数据整体导入 借用权限设定-借用人员信息添加(Access database inventory query compiler vs2005.MFC write your own class library. Query function decomposition in detail, most of the index using the drop-down menu design, automatically search the database to add the appropriate content, easy access, remove the keys manually add ... data add convenience for Excel overall import, convenient maintenance. Stock Search- enter automatically query inventory and check out the library index tracking- enter automatically query all borrowed index query lending operation- borrowed and returned to the operating database maintenance- add overall import borrow delete modify and excel data permissions given- to borrow personnel information to add)

三星2440 ARM USB驱动 源代码(2440 USB driver source code)

方程求根的是抛物线法则，写的不好。仅供参考(Roots of the equation is parabolic law, badly written. Reference)

arduino ESP32 模块蓝牙通讯示例 （1）建立蓝牙服务器 （2）广播 （3）扫描周边蓝牙设备 （4）配对管理 （5）建立串口通讯，及数据传输管理(Arduino ESP32 module Bluetooth communication example (1) Establish a Bluetooth server (2) Broadcasting (3) Scanning peripheral Bluetooth devices (4) Pairing management (5) Establish serial communication and data transmission management)

是一个很简单的程序啦，不会编程的新生可以拿来玩玩(it can tracing identification,this c of a building.)

编程实现Prim算法，基于最小堆数据结构，生成最小代价生成树。 （其中随机生成点和边，形成连通图） 根据输入的顶点数的不同，分析时间复杂度。(Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected complete graph for given size n according to the following approach: 1) Randomly generate n points ( ) on a plane 2) Randomly generate k pairs of points as edges of the graph. 3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge. )