资源列表
A
- A simple airline ticket reservation program
eightqueens
- 用于实现著名的八皇后问题（详细情况请参考百度等网站）-For the realization of the famous Eight Queens problem (for details, please refer to Baidu and other sites)
pagerankc
- PageRank算法的C++实现，个人觉得性能还不错，希望大家提出修改意见- PageRank algorithm C++,
Minimumspanningtree
- 最小生成树的实现，很简练，希望对您有帮助-Minimum spanning tree
Homework_of_DataStruct
- 这是我在学数据结构（严蔚敏版）时的上机作业，包含哈夫曼树、图的遍历、文学研究助手（处理字符串）、多项式计算器、矩阵计算器、马踏棋盘、停车场管理、约瑟夫环的成功运行源程序。它们都是对经典数据结构及其之间的组合的练习。-This is my school data structure (Yan Wei-min version) when the machine operations, including Huffman tree, graph traversal, literature resear
ACM_Some
- 这些是我在编写ACM题目时实现的程序，ACM对于初级程序员的影响应该是质的改变，文件中实现的是在PKU JudgeOnline（http://poj.org/）平台上一些题目，文件名中，包括1222,1363,1979,1208。 -These are what I achieved in the preparation of the procedure when the subject ACM, ACM junior programmer for the impact should be
Basic_C_Programing
- 这是在学完C语言程序设计，在没学数据结构的时候老师布置的几道题目，包括“简单的学生成绩管理软件”、“螺旋阵列”、“任意年份日历的打印”、“长整数运算”和“八皇后问题”，所有代码都是我自己实现的。-This is the completion of C programming language, in not studied the data structure when the teacher arranged a few, topics, including " simple stud
nibolanshi
- 运算表达式转换为逆波兰式，输入运算符表达式如(6+2)*5-8/4，输入将是逆波兰式62+5*84/--Operation expression into Reverse Polish Notation, the input operator expressions such as (6+2)* 5-8/4, input will be the Reverse Polish Notation 62+5* 84 /-
jisuanjibolanshi
- 逆波兰式的计算。 输入逆波兰式，目前只支持+-*/^ 加减乘除幂求余这几种运算，输出逆波兰式的值。有兴趣的朋友可以去扩充下功能-Reverse Polish calculator. Enter the Reverse Polish Notation, currently only supports+-*/^ Math remainder these types of computing power, the output value against the Polish. Friends
linjiejuzhen
- 8.3.1利用邻接矩阵的图广度优先遍历算法-8.3.1 Using the adjacency matrix of the graph breadth-first traversal algorithm
hangdian1016
- Prime Ring Problem 杭州电子科技大学ACM在线判定系统的1016题素数环，本人自己写的算法，有兴趣的同学可以拿去参考下，正常情况是可以AC的-Prime Ring Problem, Hangzhou University of Electronic Science and Technology ACM determine the system' s 1016 title-line prime ring, I write their own algorithms, in
linjiebiaodetu
- 8.3.2利用邻接表的图广度优先遍历算法-8.3.2 Using the adjacency list of graph breadth-first traversal algorithm