strcon

说明：  图的相关操作：建立图，图的遍历，查找元素，删除元素等(Map-related steps: the establishment of map, graph traversal, find elements, delete elements, etc.)

编写一个将二叉树的所有叶子结点从左向右链接成单链表的算法(Write a binary tree leaf nodes from left to right links into a single linked list algorithm)

说明：  标准答案习题1 1.1 简述C++语言程序的结构特点。 答： （1）C++程序由一个或多个函数组成，其中至少有一个主函数main()，程序从主函数开始执行，由主函数来调用其他函数。(Standard answer to Exercise 11.1 on C++ Language program structural characteristics. Answer: (1) C++ Procedures by one or more functions, of which at least one of the main function main (), the procedure started from the main function, from the main function to call the other function.)

主要用栈和树求解骑士问题，用C++语言编写的(The main stack and tree Cavalier Problem Solving with C++ languages)

用银行家算法实现资源分配,Bankers algorithm to achieve the allocation of resources(Bankers algorithm to achieve the allocation of resources)

VC++常用的数据结构类源码 这是我在VC++日常开发中收集的一些经常用到的类库，每一款都可以轻松重用，这些类库适用于vs2003及以上的开发环境，其中 Thread 和 Delegate 是从C#中得到的灵感，还有一些是在使用开源代码或其它语言时得到的启发和灵感。个人认为部分代码还算好用，所以拿来分享一下。部分类库附带有例子，欢迎参考。 (Commonly used data structures in VC++ class source This is the daily development of VC++ I collected some frequently used library, each designed to easily reuse these libraries apply to vs2003 and development environment, including Thread and Delegate inspiration from C#, there are some inspired use of open source code or other languages ​ ​ and inspiration. Personally think that part of the code is fairly easy to use, so used to share. Some class library included with examples for reference.)

该ppt包含了栈和队列的数据结构及基本操作，同时还有栈的举例(This ppt contains the stack and queue data structure and basic operation, as well as examples of the stack)

c语言编写链式线性表的初始化，创建，插入删除等操作。(c language chained linear table is initialized, create, insert and delete operations.)

Polynomial基于数据结构的思想,文件比较小,可以直接运行(Polynomial based on the idea of ​ ​ data structures, file is relatively small and can be run directly)

主要是DIJKSTRA经典算法，可以作为单个算法来读，也可以调用。(DIJKSTRA mainly classical algorithm can be read as a single algorithm can also be called.)