搜索资源列表
prj143
- 这是关与系统名称系统实施工作计划的内容-This the name of customs system and the implementation of the system of work plan
GreatScheduleControl
- 计划时间计算控件，可以把人性化的任务安排转换成任务执行的确切时间［控件］［代码］-plan, calculated in the time control, human nature and the mission of conversion arrangements mandate of the exact time [control] [code]
tude遍历
- 图的遍历算法包括先序，后序，中序等多种遍历次序，还有图的初始化等-traversal algorithm of the plan include the first sequence after sequence, sequence and other traversal sequence, and there are also such as the initialization
longest
- 输入一个带权图的无向图，求出其中一个顶点到其它顶点最长的路径，并输出这条最长路径-input with a map without the right to plan, which sought a vertex to vertex other the longest path, and the output of the longest path.
5班8号周前平
- 输入一个有向图，用深度优先搜索，判断该图是否为一有圈的图。-importation of a directed graph, with the depth-first search to determine whether the plan is a map of the circle.
5班8号周前平第2题
- 单源最短路径问题。从文件中读入一个图，求一个顶点到其它所有顶点的最短路径。-single source shortest path problem. Reading from the document into a plan and seek a culmination of all the other vertices in the shortest path.
htxgl_0
- 把WINDOWS下的CAD作的图转化为DOS下的C作图，可用于CAM-put under Windows CAD for the plan into DOS C mapping can be used CAM
graphserch
- 此个小程序是用于实现图的操作的,用邻接表的形式存图,实现遍历的函数-this small procedure is used to implement the plan to operate, with the adjacent table in the form of retention plan to achieve iterated function
LICOLOR
- 是一个有关图着色问题的程序，C语言写的，程序很短，但是所用的算法很新-The plan is a rendering of the procedures, written in C language, procedures are very short, but by the very new algorithm
MaxSpanningTree
- 求最大生成树，实际上是以最小生成树的算法为基础进行改进，我采用的是kruskal算法，基本思路是对各个边的权进行排序，然后加入生成树，形成环的点跳过，直到生成最大生成树。JAVA的特点是输入输出比较便利，所以问题的关键在于用监控将图的初始化和树的生成衔接。-Spanning Tree for the largest, is actually the minimum spanning tree algorithm-based improvement, I used the Kruskal algo
ScribbleGameDraw
- 用C＋＋编的简单的话图程序，比较好玩的，我花了两个小时才编出来的！-C + + Part of the plan simple procedures, more fun, I spent two hours before the series!
PRAGH_caq
- 一个工程的图算法小程序，用于计算工期，关键路径的-one of the plan algorithm small program used to calculate the time limit, critical path
erbutu
- 二部图的一个算法-two of the plan is an algorithm
campus_dao_you
- 数据结构中 有关于图的操作，采用visul c++ 6.0 ,界面显示校园地图，可以计算出两地间的最短距离。-data structure on the operation plan, adopted visul c 6.0, the interface shows the campus map can be worked out between the two shortest distance.
GraphEx
- 在VC++.NET2003实现的图的算法实现包括遍历创建图的实现-in VC.NET2003 realization of the plan, including traversal algorithm to create the plan to achieve
brrmail
- 將網頁的查詢出來的界面，通過郵件發送出去，可以做為計劃排程來定時的發送-website inquiries to the interface through mail sent, as a plan to schedule regular delivery
Curriculum
- 课程安排，用拓扑排序实现 4、实现课程的拓扑排序。(选)（加）问题描述：软件专业的学生要学习一系列课程，其中有些课程必须在其先修课程完成后才能学习，具体关系见下表：课程编号 课程名称 先决条件 C1 程序设计基础 无 C2 离散数学 C1 C3 数据结构 C1，C2 C4 汇编语言 C1 C5 操作系统 C3 假设每门课程的学习时间为一学期，试为该专业的学生设计教学计划，使-curriculum, and topological sorting achieve four to achieve c
DELPHI-Time.rar
- 一个象windows计划任务一样的可设置程序定时执行的程序原代码,Plan a task, as the same windows can be set up procedures for the implementation of the procedures from time to time the original code
plan9jun.tar
- 著名操作系统Plan 9的第三版的部分核心源代码。现在很难找到了。Plan 9是bell实验室开发的Unix后继者。-Well-known, the third edition of Plan 9 operating system, part of the core source code. Now difficult to find. Plan 9 was developed in the laboratory bell successor Unix.
Plan
- 工作计划推进程序，输入工作内容并设定计划时间-work plan