Search - graph - CodeBus

Search - graph - List

[OS Develop] graph DL : 0: 数据结构有关图的算法。矩阵和链表实现的都有。实现先序中序后序遍历算法。
Date : 2008-10-13 Size : 10.36kb User : hanjianya
[OS Develop] Graph DL : 0: 操作系统实验，对文件系统进行模拟设计。
Date : 2008-10-13 Size : 20.41kb User : 杨的的
[OS Develop] graph DL : 0: 数据结构有关图的算法。矩阵和链表实现的都有。实现先序中序后序遍历算法。-Data structure on the graph algorithms. Matrix and list of all realize. Realize after the first sequence in the sequence traversal algorithm.
Date : 2026-01-01 Size : 10kb User : hanjianya
[OS Develop] 2005 DL : 0: ⑴模拟一个死锁检测算法； ⑵该算法能通过简化资源分配图来检测死锁； ⑶资源分配图可以用矩阵的形式表示； ⑷输出结果为有死锁或无死锁。 -⑴ simulation of a deadlock detection algorithm ⑵ The algorithm can simplify the resource allocation graph to detect deadlock ⑶ resource allocation plan can be expressed in the form of matrix ⑷ output for the deadlock or deadlock-free.
Date : 2026-01-01 Size : 72kb User : gaoliang
[OS Develop] sy7 DL : 0: 导游咨询系统，对输入的景观图的数据，进行运算，得到最近路径-Guide to enter the system, consultation, the data of landscape graph, recent calculations
Date : 2026-01-01 Size : 1.14mb User : gyc
[OS Develop] neicunmoni DL : 0: 3）必须模拟该4种内存分配算法：first fit，next fit，best fit和worst fit中的至少2种。 4）需显示出每次分配和回收后的空闲分区链的情况来以及内存占用情况图，并统计各种算法产生的碎片空闲区（小于3个单元（unit）的空闲区）数。 5）计算2个性能参数：碎片数、平均搜索空闲区次数-3) must simulate the four kinds of memory allocation algorithms: first fit, at least two kinds of next fit, best fit and worst fit in. 4) the need to show the situation after each allocation and recovery partition chain to idle and memory usage graph and statistical debris generated by various algorithms free zone (less than 3 units (unit) free zone) number. 5) Calculation of individual performance parameters: the number of fragments, the average number of idle search area
Date : 2026-01-01 Size : 2kb User : 刘万友
[OS Develop] OWNS DL : 0: optical wired network with graph partitioning algorithm for all nodes
Date : 2026-01-01 Size : 774kb User : Naveen