搜索资源列表
AlogortithmsExperiment
- 在eclipse下开发的求平面上两点之间的最短距离。通过随机在平面上生成无数个点，求其中两点间的最短距离，以及这两点。-the eclipse under development for the plane between two points is the shortest distance. Through random plane generated numerous points, two points for the shor
ShortestPath_Djk
- 用 MATLAB编写的最短路径算法 ShortestPath_Djk-using MATLAB is the shortest path algorithm ShortestPath_Djk
ProcessCall
- 操作系统中的进程调度，进程调度模拟程序：假设有10个进程需要在CPU上执行，分别用：先进先出调度算法；基于优先数的调度算法；最短执行时间调度算法 确定这10个进程在CPU上的执行过程。要求每次进程调度时在屏幕上显示：当前执行进程；就绪队列；等待队列 -operating system process scheduling, process simulation scheduling procedures : Assuming a
Linux0.11soucecode
- 本书对Linux 早期操作系统内核(v0.95)全部代码文件进行了详细全面的注释和说明，旨在使读者能够在尽量短的时间 内对Linux 的工作机理获得全面而深刻的理解，为进一步学习和研究Linux 系统打下坚实的基础。-book on the early Linux operating system kernel (v0.95) all the code for the document detailed and comprehens
xiaoyuandaohang
- 一个简单的校园导航程序，可查询最短路径。-a simple campus navigation procedures, will be able to access the shortest path.
pcos
- 21.c 先来先服务（FCFS）算法调度作业运行。 211.c最短作业优先（SJF）调度算法。 212.c响应比高者优先（HRN）调度算法-21.c first-come first-service (FCFS queue) algorithm scheduling operations running. 211.c shortest priority operations (SJF) scheduling algorithm.
Data_ShorPath
- 数据结构课程的经典源码。以中国交通图为背景，求各大城市之间的最短路径。读文件操作。-data structure course of the classic source. China traffic map background, major cities seeking the shortest path between. Reading file manipulation.
excellentwaysofshortpath
- 程序的主要功能是实现有向图最短路径的搜索，采用的数据是txt格式的邻接矩阵，采用的算法为改进的狄氏算法。内附调试和文件说明。-procedures main function is to achieve the shortest path to the map search, The data format is txt adjacent matrix, the algorithm to improve the dieldrin alg
tusuanfa
- 用vc++6.0实现图－邻接矩阵-最短路径.数据结构课程必备，有一定参考价值。-with vc 6.0 map-adjacency matrix-shortest path. Data structure courses required that a certain reference value.
qASSIGNMENT2
- 这是帮那留学生做的第二个作业,里面有详细的文档资料,要求运用到 链表 图 和最短路径算法. Dijkstra-This is to help the students so that the second operation, which has detailed information on the document, Listless request to use maps and the shortest path algorit
zuiduanlujingssss
- 这实一个求最短路径的实验，对初学者很有用，特别实学习 数据结构的同学-This is a shortest path experiment, very useful for beginners, in particular data structure is learning students
nearestroad
- 本文提出一种VB+MO实现最短路径查的思路，具体代码请自己实现-VB MO achieve the shortest path investigation of thinking, their specific codes, please realize
ImproveShortestPathArithmetic
- 应用斐波纳契堆和邻接表改进单源最短路径算法，使其算法的时间复杂性由O( )减少为O（nlogn+e）,其中e为有向图的边的条数。-application Fibonacci heap and the adjacent table to improve single source shortest path algorithm, its algorithm's time complexity of O () reduced to
Bank_Simulation
- 银行业务情况模拟（银行有四个柜台。客户随机地进入银行办理业务，每个人办理业务需要的时间也是随机确定。客户进入银行后选择队列最短的队列排队，如果队列都一样长，则随机选择一个队列排队。客户进入队列后，如果是队列第一个，则接受银行服务，直到服务完成，然后离开银行。-banking business of simulation (4 bank counters. Random access to customer bank business,
50402417
- 和树类似，图的遍历是图的一种主要操作，可以通过遍历判别图中任意两个顶点之间是否存在路径、判别给定的图是否是连通图并可求得非连通图的各个连通分量，但对于带权图（网），其最小生成树或最短路径都取决于弧或边上的权值，则需要有特定的算法求解。-and similar trees, graph traversal map is a major operation, Discrimination can traverse map between a
zhudlj
- 最短路径的分析，可以用于理解迪克杰拉和FLOYD的算法。-shortest path analysis can be used to understand and Dikejiela FLOYD algorithm.
graphbfs
- 读图并输出图的邻接链表，输入两个结点，用广度优先寻找它们之间的最短路径并输出，并判断其是否是树，是否连通，是否有环，有要打印出来环．-interpret drawings and prints of adjacent chain, the importation of two nodes, with breadth between them priority for the shortest path and output, and a
dijkstrahop
- 修改ＤＩＪＫＳＴＲＡ算法，输出其过程中经过结点的个数．-revised algorithm, the process of its output after the number of nodes.
Sys-simulate
- 模拟先来先服务作业调度 模拟最短作业优先作业调度 模拟响应比高者优先作业调度 -simulated first-come first-service job scheduling simulation shortest priority job scheduling operations simulation response ratio were higher priorities Job Scheduling