搜索资源列表
process_minachen
- 综合应用下列知识点设计并实现操作系统的进程调度:邻接表,布尔数 组,非阻塞输入,图形用户界面 GUI,进程控制块,进程状态转换,多级反馈队列进程调度算法。-integrated application knowledge point following the design and realization of the process of scheduling the operating system : the adjacent table, boolean arrays, nonblock
shortest
- Dijkstra算法通过邻接表实现最短路径,-Dijkstra algorithm to achieve the shortest path adjacency list,
linkgragh
- 图的邻接表存储的所有功能实现在vC下调试通过-Graph adjacency list all the features of the realization of storage in vC debugging through
graph
- windows下实现图的所用功能,包括:创建有向图和无向图的邻接表,给出有向图的邻接表,创建出逆邻接表-windows used to achieve chart features, including: creating a directed graph and undirected graph of adjacency list is given with the adjacency table, create a reverse adjacency list, etc.
the-shortest-path-of-chart
- 求有向图的最短路劲,根据所给图的边长和顶点,建立有向图,以邻接表的方式存储,并编写程序求从有向图任一点出发的最短路径-according to the graph with sides and vertex, establish a directed graph, and write a program find the shortest path from one of the point of the chart
AOE
- 用邻接表存储有向图并建立AOE网; 用图形的形式输出有向图; 输出关键路径和关键活动。-Adjacency table is stored AOE directed graph and the establishment of networks In the form of graphics output directed graph Output critical path and critical activities.