-
BFS
迷宫问题 队列求解 界面还不完善 可以自己添加(Maze problem solving interface queue is not perfect you can add your own)
- 2013-12-26 22:08:58下载
- 积分：1
-
labyrinth
迷宫问题c源代码，大小为8*8的迷宫。主函数中输入开始位置和结束位置的坐标，输出所有可能的路径(Maze c source code, size 8* 8 of the maze. Enter the start the main function of the coordinates of the position and end position, the output of all possible paths)
- 2010-12-19 23:31:36下载
- 积分：1
-
migong
输入迷宫行列数，1代表墙0代表路，之后系统生成路径(Enter the maze ranks number 1 represents 0 for Wall Road, after the system-generated path)
- 2016-05-14 20:16:00下载
- 积分：1
-
8queen
此程序用于解决8皇后问题，运行后输出8皇后问题的所有解(This program is used to solve the 8 queens problem, all solutions of 8 queens problem output operation.)
- 2013-05-06 21:15:23下载
- 积分：1
-
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
-
dxsjjc
多项式加减乘 用数据节够得算法实现多项式的加减乘 原理简单易懂(suoxiangshi jiajiancheng)
- 2009-12-29 11:13:13下载
- 积分：1
-
Maze
实现迷宫搜索程序。迷宫数据从文件输入。输出迷宫路径。
a) 实现从入口到出口的输出顺序；
b) 能否打印行走方向（向左、向右、向前）， 如： 1 先前 2 向右 6 向左 7；
(Maze searching)
- 2011-12-20 20:59:04下载
- 积分：1
-
FreeTree
无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)
- 2013-10-29 16:31:47下载
- 积分：1
-
017
广度优先搜索及深度优先搜索，用C语言实现，比较使用(Breadth-first search and depth first search, using C language, compared with)
- 2011-07-09 15:27:40下载
- 积分：1
-
Kruskal
克鲁斯卡尔算法思想.cpp
int seekedge(EDGE * (&a), int n)
void bubble(EDGE * (&a), int size)
void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针，a2是最小生成树边集的头指针，k为所要删的边
void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )
- 2009-06-27 01:43:39下载
- 积分：1
