-
PrintTheSchedule_DataStructure_Lab4
数据结构试验-打印输出计算机本科专业4年每学期的课表;C++实现;图的邻接表存储结构以及拓扑排序的基本思想(Data structure test- printout computer 4 years of undergraduate per semester timetables C++ achieve basic idea of the adjacency table storage structure and topological sorting)
- 2012-11-24 23:30:41下载
- 积分:1
-
a
说明: 进程死锁.资源分配图的绘制 建立所需数据结构;
使用题目21存成的资源分配图的文件作为输入;
编写资源分配图化简算法;
每化简一步,在屏幕上显示化简的当前结果;
最后给出结论,是否死锁,如思索给出死锁的进程及资源;
(Process deadlock. Resource allocation mapping establish the required data structures Use title 21 deposit into resource allocation graph file as input writing resource allocation map simplification algorithm Each simplification step, on-screen display simplification of the current result Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )
- 2013-07-04 19:50:58下载
- 积分:1
-
EightQueens
数据结构与程序设计中的重点例子程序:八皇后问题(Data structure and procedures of the focus of the design example of the procedure: eight queen problem)
- 2009-06-29 14:52:11下载
- 积分:1
-
edge-betweenness
计算边介数,复杂网络,中心性计算,介数也可以计算,运用了数据结构,计算大量数据(edge betweenness,complex network, centrality)
- 2021-05-15 01:30:03下载
- 积分:1
-
Lecture6
数据结构中链式队列和堆栈的循环用法,非常有用(Queue data structure in the chain and the cycle stack usage, very useful)
- 2011-07-27 15:30:29下载
- 积分:1
-
dd2
自己用c语言写的一个模块化多电平最近电平调制排序的c程序,希望对大家有帮助(Own use c language written in a modular multi-level modulation level recently sort of c program, we hope to help)
- 2014-05-21 20:19:49下载
- 积分:1
-
maopao_youhua
冒泡优化:
如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行,优化之后1次就好,也就是说序列越接近于正常序列,改进之后的冒泡排序的次数就越少,这样会给一个冒泡排序算法带了很大的效率。
思想:添加一个boolean变量用来判断冒泡是否是已经排好了顺序,如果boolean的值为false,说明是已经排好了,如果boolean的值true,说明没有排好,继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency.
Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)
- 2012-04-18 00:33:45下载
- 积分:1
-
work_std
工作时单元功能实现的部分资料
主要涉及字符串处理、排序算法,字符串查询、kmp、改进二分法、Unicode编码、uniq(functional modules work to achieve some of the information involved mainly string handling, sorting algorithm, string inquiries, kmp improve dichotomy, Unicode encoding, uniq)
- 2007-01-23 08:57:38下载
- 积分:1
-
Fund6-StringViewer
字符串,实现了文件中查找想要的字符串,并将其标记出来
- 2010-12-26 20:51:45下载
- 积分:1
-
Graph
数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)
- 2013-11-28 10:53:29下载
- 积分:1