CSharpSMS

栈采用顺序栈存储，该算法是将表达式转换成后缀表达式输出。(Stack sequential memory stack, the algorithm is to convert the expression into a postfix expression output.)

说明：  xtrap source code XtrapUpdater

给定一个赋权无向图G=(V,E)，每个定点v∈U都有一个权值w(v)。如果U V，且对任意(u,v)∈E有u∈U或v∈U，就称U为图G的一个定点覆盖。G的最小权顶点覆盖是指G中所含顶点权之和最小的顶点覆盖。(Empowering given a undirected graph G = (V, E), each point v ∈ U has a weight w (v). If the UV, and for any (u, v) ∈ E there is u ∈ U or v ∈ U, on U that map G to a fixed-point coverage. G the right to the minimum vertex cover is contained in G refers to the right vertex of the vertex cover and minimum.)

C# 串口通信源码示例，老外写的，非常精美。(Serial Communication C# source code examples, written by foreigners, very fine.)

Csharp开发google erth，开发工具：VS2010,开发环境：win7 64位，基本实现温伟鹏 “C# 调用 Google Earth Com API开发（三）”的功能http://www.cnblogs.com/wpwen/archive/2009/05/22/1486892.html。但实现更为灵活，无需HookAPI，基于此框架，可以开发面向专业领域的应用。(Csharp development google erth, basically Wen Weipeng " C# called Google Earth Com API development (c)" function http://www.cnblogs.com/wpwen/archive/2009/05/22/1486892.html. However, to achieve more flexible, without HookAPI, based on this framework can be developed for the professional fields.)

STM32的正弦波逆变器资料，内置pcb原理图和pdf概要(data of STM32 sinusoidal inverter)

GD32F库函数，各种外设，gpio等等(gd32 library v2.0.0 gpio ..)

池塘夜降彩色雨，可以用的。大家试试看。呵呵(wuu)

斐波那契堆基于二项式堆,在支持以O(1)时间实现插入、合并和以O(log n)实现删除最小元素的基础上，进一步实现了以O(1)实现指定节点值减少和用O(log n)时间完成删除任意节点操作(Fibonacci heap-based binomial heaps of support to the O (1) time to achieve insertion, Merger and O (log n) to achieve the smallest element deleted on the basis of further to the O (1) to achieve specified nodes and reduce the value of O (log n) time to complete the deletion of arbitrary nodes parade for)

网络课程的通信代码，有服务器端和客户端，可以实现客户与服务器的通信与文件传输(Online course communication code, server and client, client and server communications and file transfer can be achieved)