-
Figure-topological-sort
说明： 拓扑排序
对一个 有向无环图 G进行拓扑排序，是将G中所有顶点排成一个线性序列，使得图中任
意一对顶点u和v，若u，v ∈E，则u在线性序列中出现在v之前。
通常，这样的线性序列称为满足拓扑次序的序列，简称 拓扑序列 。
注意：
①若将图中顶点按拓扑次序排成一行，则图中所有的有向边均是从左指向右的。
②若图中存在有向环，则不可能使顶点满足拓扑次序。
③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort
In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post
Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before.
Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence.
Note:
(1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing.
(2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence.
(3) a DAG topological sequence usually expressed some scheme is feasible.
)
- 2011-03-22 17:19:14下载
- 积分：1
-
BigNumeberOperator
这是高精度大数运算的源码,对于大于64位的整形数字的四则运算，是万能的啊……(This is the code of big number s operator.)
- 2011-08-09 15:25:09下载
- 积分：1
-
bagproblem
讲述各种背包问题,帮助了解关于背包问题的算法分析与过程实现。(for the problem about the bag problem ，to solve the problem and find the most effective way of the solution. )
- 2010-06-14 14:08:14下载
- 积分：1
-
数据结构(C语言版)
说明： 该书籍详细讲述了C语言的数据结构部分，不断提高你的编程能力。(This book describes the data structure of C language in detail, and constantly improves your programming ability.)
- 2020-06-22 07:00:01下载
- 积分：1
-
matrixTran
稀疏矩阵的快速转置方法，简单的实现方法，适合初学者(Fast transpose sparse matrix methods, a simple method which is suitable for beginners)
- 2014-02-28 21:19:22下载
- 积分：1
-
jiaotong
用于课程设计 利用Dijkstra算法进行简单的最短路径查询 (For curriculum design simple shortest path query)
- 2013-03-23 13:06:49下载
- 积分：1
-
main
以一个m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。
1.基本要求
（1）首先实现一个以链表作存储结构的栈类型，然后编写一个求解迷宫的非递归程序。求得的通路以三元组（i，j，d）的形式输出。其中：（i，j）指示迷宫中的一个坐标，d表示走到下一坐标的方向。如下图所示迷宫。从入口（1，1）到出口（8，8）的求解结果如下：
（1，1）（1，2），（2，2）（3，2）（3，1）（4，1）（5，1）（5，2）（5，3）（6，3）（6，4）（6，5）（5，5）（4，5）（4，6）（4，7）（3，7）（3，8）（4，8）（5，8）（6，8）（7，8）（8，8）(The labyrinth is represented by a m*n rectangular array. 0 and 1 represent the pathways and obstacles in the labyrinth respectively. Design a program for any set of maze, find a way from the entrance to the exit, or draw no conclusion of the path.
1. basic requirements
(1) first implement a stack type with linked list as storage structure, then write a non recursive procedure to solve the maze. The path obtained is output in the form of three tuple (I, J, d). Among them: (I, J) indicates a coordinate in the labyrinth, and D indicates the direction of going to the next coordinate. As shown in the labyrinth below. The results obtained from the entrance (1, 1) to the outlet (8, 8) are as follows:
(1, 1) (1, 2), (2, 2) (3, 2) (3, 1) (4, 1) (4, 1).)
- 2018-07-03 13:15:46下载
- 积分：1
-
Maze
IEEE电脑鼠走迷宫程序（带有记忆功能和智能算法）(IEEE Computer Mouse Maze procedure (with memory function and intelligence algorithm))
- 2010-03-12 20:51:23下载
- 积分：1
-
poops
My realization of binary tree. This example is search tree.
- 2013-01-14 15:29:47下载
- 积分：1
-
2
说明： 用数据结构的遍历，对于小毛驴过河解决实际问题。(Traversing the data structure used for the small donkey across the river to solve practical problems.)
- 2010-06-02 22:50:30下载
- 积分：1
